Skip to main navigation Skip to search Skip to main content

Leader election in well-connected graphs

  • Seth Gilbert
  • , Peter Robinson
  • , Suman Sourav*
  • *Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

Abstract

In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in any general network with O(n log7/2 n · tmix ) messages and in O(tmix log2 n) time, where n is the number of nodes and tmix refers to the mixing time of a random walk in the network graph G. For several classes of well-connected networks (that have a large conductance or alternatively small mixing times e.g. expanders, hypercubes, etc), the above result implies extremely efficient (sublinear running time and messages) leader election algorithms. Correspondingly, we show that any substantial improvement is not possible over our algorithm, by presenting an almost matching lower bound for randomized leader election. We show that Ω(n/3/4) messages are needed for any leader election algorithm that succeeds with probability at least 1 − o(1), where refers to the conductance of a graph. To the best of our knowledge, this is the first work that shows a dependence between the time and message complexity to solve leader election and the connectivity of the graph G, which is often characterized by the graph's conductance . Apart from the Ω(m) bound in [23] (where m denotes the number of edges of the graph), this work also provides one of the first non-trivial lower bounds for leader election in general networks.

Original languageEnglish
Title of host publicationPODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
Number of pages10
PublisherAssociation for Computing Machinery (ACM)
Publication date23 Jul 2018
Pages227-236
ISBN (Print)9781450357951
DOIs
Publication statusPublished - 23 Jul 2018
Externally publishedYes
Event37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 - Egham, United Kingdom
Duration: 23 Jul 2018 → 27 Jul 2018

Conference

Conference37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018
Country/TerritoryUnited Kingdom
CityEgham
Period23/07/2018 → 27/07/2018
SponsorACM SIGACT, ACM SigOps
SeriesProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Bibliographical note

Publisher Copyright:
© 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM.

Keywords

  • Conductance
  • Leader election
  • Mixing time
  • Random walks

Fingerprint

Dive into the research topics of 'Leader election in well-connected graphs'. Together they form a unique fingerprint.

Cite this