Abstract
We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader election algorithm is stable if it ensures that once a leader is elected, it remains the leader for as long as it does not crash and its links have been behaving well, irrespective of the behavior of other processes and links. In addition to being stable, our leader election algorithms have several desirable properties. In particular, they are all communication-efficient, i.e., they eventually use only n links to carry messages, and they are robust, i.e., they work in systems where only the links to/from some correct process are required to be eventually timely. Moreover, our best leader election algorithm tolerates message losses, and it ensures that a leader is elected in constant time when the system is stable. We conclude the paper by applying the above ideas to derive a robust and efficient algorithm for the eventually perfect failure detector ◊P.
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
M. K. Aguilera, W. Chen, and S. Toueg. Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science, 220(1):3–30, June 1999.
M. K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. Distributed Computing, 13(2):99–125, April 2000.
M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Stable leader election. Technical Report 2001/04, LIAFA, Université D. Diderot, 2 Place Jussieu, 75251, Paris Cedex 05, France, 2001.
T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685–722, July 1996.
F. Chu. Reducing Ω to ◊W. Information Processing Letters, 67(6):298-293, September 1998.
T. D. Chandra and S. Toueg. Unreliable failure detectors for asynchronous systems. Journal of the ACM, 43(2):225–267, March 1996.
W. Chen, S. Toueg, and M. K. Aguilera. On the quality of service of failure detectors. In International Conference on Dependable Systems and Networks (DSN 2000), pages 191–200, NewYork, June 2000. A full version of this paper will appear in the IEEE Transactions on Computers.
C. Dwork, J.Y. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. SIAM Journal on Computing, 27(5):1457–1491, 1998.
R. De Prisco, B. Lampson, and N. Lynch. Revisiting the Paxos algorithm. In Proceedings of the 11thWorkshop on Distributed Algorithms(WDAG), pages 11–125, Saarbrücken, September 1997.
C. Fetzer, M. Raynal, and F. Tronel. A failure detection protocol based on a lazy approach. Research Report 1367, IRISA, November 2000.
M. Larrea, S. Arévalo, and A. Fernández. Efficient algorithms to implement unreliable failure detectors in partially synchronous systems. In Proceedings of the 13th International Symposium on Distributed Algorithms(DISC99), pages 34–48, Bratislava, September 1999.
L. Lamport. The part-time parliament. ACMTransactions on Computer Systems, 16(2):133–169, 1998.
]M. Larrea, November 2000. Personal communication.
M. Larrea, A. Fernández, and S. Arévalo. Eventually consistent failure detectors. In Brief Annoucement the 14th International Symposium on Distributed Algorithms(DISC00), Toledo, October 2000.
M. Larrea, A. Fernández, and S. Arévalo. Optimal implementation of the weakest failure detector for solving consensus. In in Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, SRDS 2000, pages 52–59, Nurenberg, Germany, October 2000.
A. Mostefaoui and M. Raynal. Leader-based consensus. Research Report 1372, IRISA, December 2000.
R.Van Renesse, Y. Minsky, and M. M. Hayden. A gossip-based failure detection service. In Proceedings of Middleware’ 98 (Sept. 1998), September 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S. (2001). Stable Leader Election. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive