Abstract
In distributed networks, a single process is selected as the coordinator for each task to be performed. This coordinator process acts as the leader and synchronizes all the processes to execute a particular task. Hence, the leader is first elected before initiating the execution of the task. Two standard algorithms used for leader election are bully and ring election algorithms. But both these algorithms have their respective pitfalls. This paper focuses on combining these two algorithms with the help of hypergraphs to overcome these drawbacks. Initially, the two algorithms are discussed in detail, and their drawbacks are discussed. Further, the concept of hypergraphs is discussed to understand how the two algorithms can be combined, thus introducing a more efficient leader election algorithm.
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
References
Garavel H, Mounier L, Spectre P (1996) Specification and verification of various distributed leader election algorithm for unidirectional ring networks. Sci Comput Program 29
Vasudevan S, Kurose J, Towsley D (2004) Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Proceedings of the 12th IEEE international conference on network protocols, pp 350–360
Ingram R et al (2009) An asynchronous leader election algorithm for dynamic networks. In: IEEE international symposium on parallel & distributed processing, pp 1–12
Derhab A, Badache N (2008) A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans Parallel Distrib Syst 19(7):926–939
Park S, Kim Y, Hwang JS (1999) An efficient algorithm for leader-election in synchronous distributed systems. In: Proceedings of the IEEE region 10 conference, vol 2, pp 1091–1094
Kim TW, Kim EH, Kim JK, Kim TY (1994) A leader election algorithm in a distributed computing system. In: Proceedings of the fifth IEEE computer society workshop on future trends of distributed computing systems
Soundarabai P et al (2013) Message efficient ring leader election in distributed systems. In: Computer networks & communications: proceedings of the fourth international conference on networks & communications, pp 835–843
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Subramanian, E.R.S., Sri Gurubaran, B., Sayee Shruthi, A.S., Aishwarya, V., Balaji, N., Umamakeswari, A. (2020). A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems. In: Saini, H., Sayal, R., Buyya, R., Aliseri, G. (eds) Innovations in Computer Science and Engineering. Lecture Notes in Networks and Systems, vol 103. Springer, Singapore. https://doi.org/10.1007/978-981-15-2043-3_48
Download citation
DOI: https://doi.org/10.1007/978-981-15-2043-3_48
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-2042-6
Online ISBN: 978-981-15-2043-3
eBook Packages: EngineeringEngineering (R0)