A Probabilistically Correct Leader Election Protocol for Large Groups

This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characterized by probabilistic failure rates of processes and message deliveries. The protocol trades correctness for scale, that is, it provides very good probabilistic guarantees on correct termination in the sense of the classical specification of the election problem, and of generating a constam number of message, both independent of group size. After formally specifying the probabilistic properties, we describe the protocol in detail. Our subsequent, mathematical analysis provides probabilistic bounds on the complexity of the protocol. Finally, the results of simulation show that the performance of the protocol is satisfactory.

[1]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[2]  Sam Toueg,et al.  Randomized Byzantine Agreements , 1984, PODC '84.

[3]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[4]  Nathan Linial,et al.  Fast perfect-information leader-election protocols with linear immunity , 1993, Comb..

[5]  Sam Toueg,et al.  Unreliable Failure Detectors for Asynchronous Systems , 1991 .

[6]  Israel Cidon,et al.  Propagation and Leader Election in a Multihop Broadcast Environment , 1998, DISC.

[7]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[8]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[9]  David Zuckerman,et al.  Randomness-optimal sampling, extractors, and constructive leader election , 1996, STOC '96.

[10]  Gadi Taubenfeld.  Leader Election in the Presence of n-1 Initial Failures , 1989, Inf. Process. Lett..

[11]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[12]  Maria Gradinariu Potop-Butucaru,et al.  Memory space requirements for self-stabilizing leader election protocols , 1999, PODC '99.

[13]  I. Miller.  Probability, Random Variables, and Stochastic Processes , 1966 .

[14]  Robbert van Renesse,et al.  Efficient Buffering in Reliable Multicast Protocols , 1999, Networked Group Communication.

[15]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[16]  Andre Schiper,et al.  View Synchronous Communication in Large Scale Networks , 1995 .

[17]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[18]  Keith Marzullo,et al.  Election Vs. Consensus in Asynchronous Systems , 1995 .

[19]  David Peleg,et al.  Time-Optimal Leader Election in General Networks , 1990, J. Parallel Distributed Comput..

[20]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[21]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[22]  Alon Itai.  On the computational power needed to elect a leader , 1990 .

[23]  Cynthia Dwork,et al.  Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..

[24]  Suresh Singh,et al.  Electing "Good" Leaders , 1994, J. Parallel Distributed Comput..

[25]  Gurdip Singh,et al.  Leader Election in the Presence of Link Failures , 1996, IEEE Trans. Parallel Distributed Syst..

[26]  Sam Toueg,et al.  Unreliable failure detectors for asynchronous systems (preliminary version) , 1991, PODC '91.

[27]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[28]  Gurdip Singh,et al.  Leader Election in Complete Networks , 1997, SIAM J. Comput..

[29]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[30]  Flaviu Cristian,et al.  A Highly Available Local Leader Election Service , 1999, IEEE Trans. Software Eng..

[31]  Rafail Ostrovsky,et al.  Simple and efficient leader election in the full information model , 1994, STOC '94.

[32]  Geneva G. Belford,et al.  A Distributed Election Protocol for Unreliable Networks , 1996, J. Parallel Distributed Comput..

[33]  Chung-Ta King,et al.  Reliable Election in Broadcast Networks , 1989, J. Parallel Distributed Comput..

[34]  Nancy A. Lynch,et al.  Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..