Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In a distributed system, multiple nodes work together to build a highly available, reliable, resource shareable, and fault-tolerant system to achieve a common goal. Here, multiple nodes work together to complete a task, so coordination is essential among these nodes. Electing a node as a system leader from among all the nodes can be a possible solution to do the coordination. Besides coordination, the leader also controls various activities like task allocation, result aggregation, efficient resource sharing, clock synchronization, and communication among the nodes of the system. In this work, we address the leader election problem through a new leader election algorithm called Failure Rate and Load-based Leader Election (FRLLE) algorithm for bidirectional ring networks. The proposed algorithm elects a node with a minimum failure rate and load as well so that the system gets a more reliable leader that can concentrate on leadership roles and activity comfortably. Like a proper leader election algorithm, this algorithm satisfies safety, liveness, and termination conditions that help to build an efficient and consistent distributed system. This algorithm reduces the message and time complexity, which means the algorithm takes fewer time steps to elect a leader by exchanging fewer messages. We compare the simulation results of the FRLLE algorithm with the well-known existing leader election algorithms and demonstrate that the FRLLE algorithm exchanges fewer messages and takes fewer time steps to elect the leader. We further carried out a priori complexity analysis and compared the outcome with the results of the simulation to corroborate our proposal.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Abraham I, Dolev D, Halpern JY (2013) Distributed protocols for leader election: a game-theoretic perspective. In: International Symposium on Distributed Computing. Springer, pp 61–75

  2. Abraham I, Dolev D, Halpern JY (2019) Distributed protocols for leader election: a game-theoretic perspective. ACM Trans Econ Comput (TEAC) 7(1):4

    MathSciNet  MATH  Google Scholar 

  3. Al Refai M (2006) A new leader election algorithm in hypercube networks. In: Symposium Proceedings Volume II Computer Science & Engineering and Electrical & Electronics Engineering, European University of Lefke, North Cyprus

  4. Al Refai M (2011) Leader election algorithm in hypercube network when the id number is not distinguished. Information & Communication Systems pp 229–237

  5. Altisen K, Datta AK, Devismes S, Durand A, Larmore LL (2016) Leader election in rings with bounded multiplicity (short paper). In: International Symposium on Stabilization, Safety, and Security of Distributed Systems. Springer, pp 1–6

  6. Antonoiu G, Srimani PK (1996) A self-stabilizing leader election algorithm for tree graphs. J Parallel Distrib Comput 34(2):227–232

    Article  Google Scholar 

  7. Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations, and advanced topics, vol 19. Wiley, Hoboken

    Book  MATH  Google Scholar 

  8. Biswas A, Dutta A (2016) A timer based leader election algorithm. In: Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld), 2016 Intl IEEE Conferences. IEEE, pp 432–439

  9. Burns JE (1980) A formal model for message-passing systems. Technical Report 91

  10. Cachin C, Guerraoui R, Rodrigues L (2011) Introduction to reliable and secure distributed programming. Springer, Berlin

    Book  MATH  Google Scholar 

  11. Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225–267

    Article  MathSciNet  MATH  Google Scholar 

  12. Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving consensus. J ACM 43(4):685–722

    Article  MathSciNet  MATH  Google Scholar 

  13. Chang E, Roberts R (1979) An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun ACM 22(5):281–283

    Article  MATH  Google Scholar 

  14. Choudhary P, Dwivedi RK, Singh U (2020) Novel algorithm for leader election process in virtual traffic light protocol. Int J Inf Technol 12(1):113–117

    Google Scholar 

  15. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press, Cambridge

    MATH  Google Scholar 

  16. Dagdeviren O, Erciyes K (2008) A hierarchical leader election protocol for mobile ad hoc networks. In: International Conference on Computational Science. Springer, pp 509–518

  17. Emek Y, Kutten S, Lavi R, Moses Jr WK (2019) Deterministic leader election in programmable matter. arXiv preprint arXiv:190500580

  18. Essinger S, Zhu X, Schnee M, Liu J, Shen X, Chen L, Lu J (2013) Wireless dual-function network device dynamically switching and reconfiguring from a wireless network router state of operation into a wireless network coordinator state of operation in a wireless communication network. US Patent 8,457,013

  19. Finkelstein M (2008) Failure rate modelling for reliability and risk. Springer, Berlin

    MATH  Google Scholar 

  20. Fujimoto RM (2000) Parallel and distributed simulation systems, vol 300. Wiley, New York

    Google Scholar 

  21. Fussell J (1975) How to hand-calculate system reliability and safety characteristics. IEEE Trans Reliab 24(3):169–174

    Article  Google Scholar 

  22. Garcia-Molina H (1982) Elections in a distributed computing system. IEEE Trans Comput 31(1):48–59

    Article  Google Scholar 

  23. Gusella R, Zatti S (1989) The accuracy of the clock synchronization achieved by tempo in berkeley unix 4.3 bsd. IEEE Trans Softw Eng 15(7):847–853

    Article  Google Scholar 

  24. Hadzilacos V (1990) On the relationship between the atomic commitment and consensus problems. In: Fault-Tolerant Distributed Computing. Springer, pp 201–208

  25. Hirschberg DS, Sinclair JB (1980) Decentralized extrema-finding in circular configurations of processors. Commun ACM 23(11):627–628

    Article  MathSciNet  MATH  Google Scholar 

  26. Ishigaki G, Gour R, Yousefpour A, Shinomiya N, Jue JP (2017) Cluster leader election problem for distributed controller placement in sdn. In: GLOBECOM 2017-2017 IEEE Global Communications Conference. IEEE, pp 1–6

  27. Kordafshari M, Gholipour M, Mosakhani M, Haghighat A, Dehghan M (2005) Modified bully election algorithm in distributed systems. WSEAS Trans Inf Sci Appl 2(8):1189–1194

    Google Scholar 

  28. Kshemkalyani AD, Singhal M (2011) Distributed computing: principles, algorithms, and systems. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  29. Lampson BW (1982) Distributed systems: architecture and implementation. Springer, New York Inc

    Google Scholar 

  30. Le Lann G (1977) Distributed systems-towards a formal approach. IFIP congress, Toronto 7:155–160

    Google Scholar 

  31. Lynch NA (1996) Distributed algorithms. Elsevier, Amsterdam

    MATH  Google Scholar 

  32. Malpani N, Welch JL, Vaidya N (2000) Leader election algorithms for mobile ad hoc networks. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM, pp 96–103

  33. Maurya AK, Tripathi AK (2018) On benchmarking task scheduling algorithms for heterogeneous computing systems. J Supercomput 74(7):3039–3070

    Article  Google Scholar 

  34. Modarres M, Kaminskiy MP, Krivtsov V (2016) Reliability engineering and risk analysis: a practical guide. CRC Press, Boca Raton

    Book  Google Scholar 

  35. Mohammad Q, Alamoush A, Basem S, Al Assaf MM, Daoud MS (2015) Embedding bus and ring into hex-cell interconnection network. Int J Comput Netw Commun (IJCNC) 7(3):47–58

    Article  Google Scholar 

  36. Owicki S, Lamport L (1982) Proving liveness properties of concurrent programs. ACM Trans Program Languages Syst (TOPLAS) 4(3):455–495

    Article  MATH  Google Scholar 

  37. Park S, Yoo S, Kim B (2018) An election protocol based on group membership detection algorithm in mobile ad hoc distributed systems. J Supercomput 74(5):2239–2253

    Article  Google Scholar 

  38. Raychoudhury V, Cao J, Niyogi R, Wu W, Lai Y (2014) Top k-leader election in mobile ad hoc networks. Pervasive Mobile Comput 13:181–202

    Article  Google Scholar 

  39. Raynal M (2013) Distributed algorithms for message-passing systems, vol 500. Springer, Berlin

    Book  MATH  Google Scholar 

  40. Refai M (2015) Leader election algorithms in torus and hypercube networks comparisons and survey. Int J Comput Sci Mobile Comput (IJCSMC) 4(1):102–111

    MathSciNet  Google Scholar 

  41. Sedgewick R, Wayne K (2011) Algorithms. Addison-Wesley Professional, Reading

    Google Scholar 

  42. Singh G (1996) Leader election in the presence of link failures. IEEE Trans Parallel Distrib Syst 7(3):231–236

    Article  Google Scholar 

  43. Sudo Y, Ooshita F, Kakugawa H, Masuzawa T, Datta AK, Larmore LL (2018) Loosely-stabilizing leader election for arbitrary graphs in population protocol model. IEEE Trans Parallel Distrib Syst 30(6):1359–1373

    Article  Google Scholar 

  44. Tanenbaum AS, Van Steen M (2007) Distributed systems: principles and paradigms. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  45. 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, 2004. ICNP 2004. IEEE, pp 350–360

  46. Villadangos J, Cordoba A, Fariña F, Prieto M (2005) Efficient leader election in complete networks. In: 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2005. PDP 2005. IEEE, pp 136–143

  47. Von Martial F (1992) Coordinating plans of autonomous agents, vol 2. Springer, Berlin

    Book  Google Scholar 

  48. Yifrach A, Mansour Y (2018) Fair leader election for rational agents in asynchronous rings and networks. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. ACM, pp 217–226

  49. Yu K, Gao M, Jiang H, Li G (2017) Multi-leader election in dynamic sensor networks. EURASIP J Wireless Commun Netw 2017(1):187–200

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Sushant Pandey, Manisha Singh, Dipty Tripathi, Ankit Jaiswal, and Suprova Sarkar for their critique in this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India

    Amit Biswas & Anil Kumar Tripathi

  2. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology Allahabad, Prayagraj, India

    Ashish Kumar Maurya

  3. LIRIS Laboratory, Université Claude Bernard Lyon 1, Lyon 1, France

    Samir Aknine

Authors
  1. Amit Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashish Kumar Maurya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anil Kumar Tripathi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Samir Aknine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amit Biswas.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Biswas, A., Maurya, A.K., Tripathi, A.K. et al. FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems. J Supercomput 77, 751–779 (2021). https://doi.org/10.1007/s11227-020-03286-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-020-03286-y

Keywords

Search

Navigation