Sublinear Bounds for Randomized Leader Election

  • Shay Kutten
  • Gopal Pandurangan
  • David Peleg
  • Peter Robinson
  • Amitabh Trehan
Conference paper

DOI: 10.1007/978-3-642-35668-1_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7730)
Cite this paper as:
Kutten S., Pandurangan G., Peleg D., Robinson P., Trehan A. (2013) Sublinear Bounds for Randomized Leader Election. In: Frey D., Raynal M., Sarkar S., Shyamasundar R.K., Sinha P. (eds) Distributed Computing and Networking. ICDCN 2013. Lecture Notes in Computer Science, vol 7730. Springer, Berlin, Heidelberg

Abstract

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only \(O(\sqrt{n}\log^{3/2} n)\) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartite n-node graph G in O(τ(G)) time and \(O(\tau(G)\sqrt{n}\log^{3/2} n)\) messages, where τ(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that \(\Omega(\sqrt n)\) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that Ω(n1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Shay Kutten
    • 1
  • Gopal Pandurangan
    • 2
    • 3
  • David Peleg
    • 4
  • Peter Robinson
    • 2
  • Amitabh Trehan
    • 1
  1. 1.Information Systems Group, Faculty of Industrial Engineering and ManagementTechnion - Israel Institute of TechnologyHaifaIsrael
  2. 2.Division of Mathematical SciencesNanyang Technological UniversitySingapore
  3. 3.Department of Computer ScienceBrown UniversityProvidenceUSA
  4. 4.Department of Computer Science and Applied MathematicsWeizmann Institute of ScienceRehovotIsrael

Personalised recommendations