Abstract
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 constant number of messages, 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.
This work was funded by DARPA/RADC grant F30602-99-1-6532 and in part by the NSF grant No. EIA 97-03470..
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, Y. Minsky, “Bimodal multicast”, ACM Trans. Computer Systems, vol. 17, no.2, May 1999, pp. 41–88.
B. Bollobas, A. Thomason, “Random graphs of small order”, Annals of Discrete Mathematics, Random Graphs ’83, vol.8, 1983, pp. 47–97.
J. Brunekreef, J.-P. Katoen, R. Koymans, S. Mauw, “Design and analysis of dy-namic leader election protocols in broadcast networks”, Distributed Computing, vol. 9, no. 4, Mar 1997, pp. 157–171
T.D. Chandra, S. Toueg, “Unreliable failure detectors for asynchronous systems”, Proc. 10th Annual ACM Symp. Principles of Distributed Computing, 1991, pp. 325–340.
B. Chor, C. Dwork, “Randomization in Byzantine agreement”, Advances in Com-puting Research, vol. 5, 1989, pp.443–498.
D. Dolev, C. Dwork, L. Stockmeyer, “On the minimal synchronism needed for distributed consensus”, JACM, vol. 34, no. 1, Jan 1987, pp. 77–97.
C. Fetzer, F. Cristian, “A highly available local leader election service”, IEEE Trans. Software Engineering, vol. 25, no. 5, Sep-Oct 1999, pp. 603–618.
M.J. Fischer, N.A. Lynch, M.S. Paterson, “Impossibility of distributed consensus with one faulty process”, Journ. of the ACM, vol. 32, no.2, Apr 1985, pp. 374–382.
R. Gallager, P. Humblet, P. Spira, “A distributed algorithm for minimum weight spanning trees”, ACM Trans. Programming Languages nd Systems, vol.4, no. 1, Jan 1983, pp. 66–77.
I Gupta, R. van Renesse, K.P. Birman, “A probabilistically correct leader election protocol for large groups”, Computer Science Technical Report ncstrl.cornell/TR2000-1794, Cornell University, U.S.A., Apr. 2000.
A. Itai, “On the computational power needed to elect a leader”, Lecture Notes in Computer Science, vol.486, 1991, pp. 29–40.
C.-T. King, T.B. Gendreau, L.M. Ni, “Reliable election in broadcast networks”, Journ. Parallel and Distributed Computing, vol. 7, 1989, pp. 521–540.
C. Malloth, A. Schiper, “View synchronous communication in large scale net-works”, Proc. 2nd Open Workshop of the ESPRIT project BROADCAST, Jul 1995.
R. Ostrovsky, S. Rajagopalan, U. Vazirani, “Simple and efficient leader election in the full information model”, Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 234–242.
O. Ozkasap, R. van Renesse, K.P. Birman, Z. Xiao, “Efficient buffering in reliable multicast protocols”, Proc. 1st Intnl. Workshop on Networked Group Communica-tion, Nov. 1999, Lecture Notes in Computer Science, vol. 1736.
A. Papoulis, Probability, Random Variables, and Stochastic Processes, McGraw-Hill International Edition, 3rd edition, 1991.
D. Peleg, “Time optimal leader election in general networks”, Journ. Parallel and Distributed Computing, vol. 8, no. 1, Jan, 1990, pp. 96–99.
R. De Prisco, B. Lampson, N. Lynch, “Revisiting the Paxos algorithm”, Proc. llt/l Intnl. Workshop on Distributed Algorithms, 1997, Lecture Notes in Computer Science, vol. 1320, pp. 111–125.
M.O. Rabin, “Randomized Byzantine generals”, Proc. 24th Annual Symp. Foun-dations of Computer Science, Nov. 1983, pp. 403–409.
L.S. Sabel, K. Marzullo, “Election vs. consensus in asynchronous systems”, Computer Science Technical Report ncstrl.cornell/TR95-1488, Cornell University, U.S.A., 1995.
S. Singh, J.F. Kurose, “Electing good leaders”, Journ. Parallel and Distributed Computing, vol. 21, no.2, May 1994, pp. 184–201.
G. Taubenfeld, “Leader election in the presence of n-1 initial failures”, Information Processing Letters, vol. 33, no. 1, Oct 1989, pp. 25–28.
S. Toueg, “Randomized Byzantine agreements”, Proc. 3rd Annual ACM Symp. Principles of Distributed Computing, 1984, pp. 163–178.
R. van Renesse, Y. Minsky, M. Hayden, “A gossip-style failure detection service”, Proc. Middleware ’98 (IFIP), Sept 1998, pp. 55–70.
D. Zuckerman, “Randomness-optimal sampling, extractors, and constructive leader election”, Proc. 28th Annual ACM Symp. Theory of Computing, 1996, pp. 286–295.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, I., van Renesse, R., Birman, K.P. (2000). A Probabilistically Correct Leader Election Protocol for Large Groups. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-40026-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41143-7
Online ISBN: 978-3-540-40026-4
eBook Packages: Springer Book Archive