Abstract
In a distributed system of nodes, leader election is the task of designating one of the nodes as the leader. In this work, we introduce ALEA, an anonymous leader election algorithm for distributed system with synchronous assumptions. The algorithm does not require a node to have knowledge of the identities of other nodes present in the network, ensuring privacy in the whole election process. Proof of other desirable properties such as uniqueness, agreement and termination are detailed as well. The overall number of exchanged messages is O(\(n^2\)), n being the number of nodes, and its actual performance is experimentally evaluated and discussed.
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
Similar content being viewed by others
References
Beaulah, S.P.: Efficient algorithms for enhanced performance in distributed systems (2014). https://shodhganga.inflibnet.ac.in/bitstream/10603/73526/25/09_chapter%204.pdf
Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: ISTCS, pp. 16–26 (1996)
Dereniowski, D., Pelc, A.: Leader election for anonymous asynchronous agents in arbitrary networks. Distrib. Comput. 27(1), 21–38 (2014)
Garcia-Molina, H.: Election in a distributed computing system. Trans. Comput. 31, 48–59 (1982)
Itai, A., Rodeh, M.: Symmetry breaking in distributive networks. In: 22nd Annual Symposium on Foundations of Computer Science (SFCS 1981), pp. 150–158. IEEE (1981)
Lamport, L.: The Part-Time Parliament, pp. 277–317. Association for Computing Machinery, New York (2019). https://doi.org/10.1145/3335772.3335939
Murshed, M., Allen, A.R., et al.: Enhanced bully algorithm for leader node election in synchronous distributed systems. Computers 1(1), 3–23 (2012)
Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 \(\{\)USENIX\(\}\) Annual Technical Conference (\(\{\)USENIX\(\}\)\(\{\)ATC\(\}\) 14), pp. 305–319 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Mitra, D., Cortesi, A., Chaki, N. (2022). ALEA: An Anonymous Leader Election Algorithm for Synchronous Distributed Systems. In: Choraś, M., Choraś, R.S., Kurzyński, M., Trajdos, P., Pejaś, J., Hyla, T. (eds) Progress in Image Processing, Pattern Recognition and Communication Systems. CORES IP&C ACS 2021 2021 2021. Lecture Notes in Networks and Systems, vol 255. Springer, Cham. https://doi.org/10.1007/978-3-030-81523-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-81523-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81522-6
Online ISBN: 978-3-030-81523-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)