Advertisement

A Novel Hypergraph-Based Leader Election Algorithm for Distributed Systems

  • E. R. S. Subramanian
  • B. Sri Gurubaran
  • A. S. Sayee Shruthi
  • V. Aishwarya
  • N. Balaji
  • A. Umamakeswari
Chapter
  • 30 Downloads
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 103)

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.

Keywords

Distributed systems Fault-intolerant Leader election Hypergraphs 

References

  1. 1.
    Garavel H, Mounier L, Spectre P (1996) Specification and verification of various distributed leader election algorithm for unidirectional ring networks. Sci Comput Program 29CrossRefGoogle Scholar
  2. 2.
    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–360Google Scholar
  3. 3.
    Ingram R et al (2009) An asynchronous leader election algorithm for dynamic networks. In: IEEE international symposium on parallel & distributed processing, pp 1–12Google Scholar
  4. 4.
    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–939CrossRefGoogle Scholar
  5. 5.
    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–1094Google Scholar
  6. 6.
    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 systemsGoogle Scholar
  7. 7.
    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–843Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • E. R. S. Subramanian
    • 1
  • B. Sri Gurubaran
    • 1
  • A. S. Sayee Shruthi
    • 1
  • V. Aishwarya
    • 1
  • N. Balaji
    • 2
  • A. Umamakeswari
    • 1
  1. 1.CSE, SOCSASTRA UniversityThanjavurIndia
  2. 2.SOCEUniversity of Missouri-Kansas CityKansas CityUSA

Personalised recommendations