Message Efficient Ring Leader Election in Distributed Systems

  • P. Beaulah Soundarabai
  • J. Thriveni
  • H. C. Manjunatha
  • K. R. Venugopal
  • L. M. Patnaik
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)

Abstract

Leader Election Algorithm, not only in distributed systems but in any communication network, is an essential matter for discussion. Tremendous amount of work are happening in the research community on election as network protocols are in need of co-ordinator process for the smooth running of the system. These so called Coordinator processes are responsible for the synchronization of the system otherwise, the system loses its reliability. Furthermore, if the leader process crashes, the new leader process should take the charge as early as possible. New leader is one among the currently running processes with the highest process id. In this paper we have presented a modified version of ring algorithm. Our work involves substantial modifications of the existing ring election algorithm and the comparison of message complexity with the original algorithm. Simulation results show that our algorithm minimizes the number of messages even in worst case scenario

Keywords

Election Coordinator Message complexity Ring algorithm  Distributed system 

References

  1. 1.
    Park SH (2011) A stable election protocol based on an unreliable failure detector in distributed systems. In: Proceedings of IEEE eighth international conference on information technology: new, generations, pp 976–984Google Scholar
  2. 2.
    Basu S (2011) An efficient approach of election Algori thm in distributed systems. Indian J Comput Sci Eng 2(1):16–21Google Scholar
  3. 3.
    Rahman MM, Nahar A (2009) Modified bully algorithm using election commission. MASAUM J Comput (MJC) 1(3):439–446. ISSN 2076 0833Google Scholar
  4. 4.
    Kim CY, Bauk SH (2006) The election protoco l for reconfigurable distributed systems. In: International conference on wireless networks (ICWN), pp 295–301Google Scholar
  5. 5.
    Kordafshari MS, Gholipour M, Jahanshahi M, Haghighat AT (2005) Modified bully election algorithm in distributed system WSEAS conferences. Cancun, Mexico, pp 11–14Google Scholar
  6. 6.
    Ben Ari C (2006) Principles of concurrent and distributed programming. 2nd edn. Pearson Education. ISBN: 10:032131283X, 13:978-0321312839Google Scholar
  7. 7.
    Garcia-Molina H (1982) Elections in distributed computing system. IEEE Trans Comput C-310:48–59Google Scholar
  8. 8.
    Andrew ST (2008) Distributed systems principles and paradigms. Tsinghua University Press, Beijing, pp 190–192MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • P. Beaulah Soundarabai
    • 1
  • J. Thriveni
    • 2
  • H. C. Manjunatha
    • 2
  • K. R. Venugopal
    • 2
  • L. M. Patnaik
    • 3
  1. 1.Department of Computer ScienceChrist UniversityBangaloreIndia
  2. 2.Department of Computer Science and EngineeringUniversity Visvesvaraya College of Engineering Bangalore UniversityBangaloreIndia
  3. 3.Indian Institute of ScienceBangaloreIndia

Personalised recommendations