ZePoP: A Distributed Leader Election Protocol using the Delay-based Closeness Centrality for Peer-to-Peer Applications

TL;DR

ZePoP is a distributed leader election protocol for P2P systems that selects an optimal leader based on delay-based closeness centrality, ensuring efficient data collection and distribution in dynamic networks.

Contribution

It introduces ZePoP, a novel protocol that combines delay-based closeness centrality with leader election for improved P2P network performance.

Findings

Successfully elects leaders close to all nodes in dynamic networks

Constructs an efficient Data Collection and Distribution Tree (DCDT)

Validated through theoretical proofs and experimental results

Abstract

This paper presents ZePoP, a leader election protocol for distributed systems, optimizing a delay-based closeness centrality. We design the protocol specifically for the Peer to Peer(P2P) applications, where the leader peer (node) is responsible for collecting, processing, and redistributing data or control signals satisfying some timing constraints. The protocol elects an optimal leader node in the dynamically changing network and constructs a Data Collection and Distribution Tree (DCDT) rooted at the leader node. The elected optimal leader is closest to all nodes in the system compared to other nodes. We validate the proposed protocol through theoretical proofs as well as experimental results.