Design and Analysis of Modified Bully Algorithm for Leader Election in Distributed System

  • Jayshree Surolia
  • Mahesh M. BundeleEmail author
Conference paper
Part of the Algorithms for Intelligent Systems book series (AIS)


The distributed system concept has been continuously used in advanced technologies and in real-time applications since last few years. The distributed concept has become important part of the information technology, and it is frequently adapted in the current scenario with different high-tech concepts. Many researchers used various algorithms like Pre-Election Algorithm, Bully–FD Algorithm, Election Commission Algorithm, Coordinator Group Algorithm, Sandipan Basu Algorithm, Fault-Tolerant Algorithm, Leader Assistant Algorithm, Alternative Group Algorithm, etc. In the depth analysis of all these algorithms, it is found that Sandipan Basu Algorithm provided the best results. In this paper, we have designed and implemented a Modified Bully Algorithm and compared with Basic Bully Algorithm, Sandipan Basu Algorithm. In this work, we have carried out performance analysis of these algorithms by varying number of nodes.


Distributed system Bully Algorithm Leader  election Node ID number Process table Fetched records 


  1. 1.
    Arghavani A, Ahmadi E, Haghighat AT (2011) Improved bully election algorithm in distributed systems. In: International Conference on Information Technology and Multimedia (ICIM), 14–16 Nov 2011, pp 1–6Google Scholar
  2. 2.
    EffatParvar M, Effatparvar M, Bemana A, Dehghan M (2007) Determining a central controlling processor with fault tolerant method in distributed system. In: Fourth International Conference On Information Technology (ITNG’07), pp 658–663 Google Scholar
  3. 3.
    Zargarnataj M (2007) New election algorithm based on assistant in distributed systems. In 2007 IEEE/ACS international conference on computer systems and applications, IEEE, pp 324–33Google Scholar
  4. 4.
    Soundarabai PB, Sahai R, Thriveni J, Venugopal KR, Patnaik LM (2014) Improved bully election algorithm for distributed systems. Int J Emerg TechnolGoogle Scholar
  5. 5.
    Mamun QE, Masum SM, Mustafa MAR (2004) Modified bully algorithm for electing coordinator in distributed system. In: 3rd WSEAS international conference on Software Engineering, Parallel Distributed Systems (SEPADS), Salzburg, AustriaGoogle Scholar
  6. 6.
    Alhadidi B, Baniata LH, Baniata MH, Al-Sharaiah M (2013) Reducing massage passing and time complexity in bully election algorithms using two successors. Int J Electron Electr Eng (IJEEE) 1(1)Google Scholar
  7. 7.
    Soundarabai PB, Sahai R, Thriveni J, Venugopal KR, Patnaik LM (2014) Improved bully election algorithm for distributed systems. Int J Emerging TechnolGoogle Scholar
  8. 8.
    Vasudevan S, Kurose J, Towsley D (2004) Design and analysis of a leader election algorithm for mobile ad hoc networks. In ICNP 2004 proceedings of the 12th IEEE international conference on network protocols, IEEE, pp 350–360Google Scholar
  9. 9.
    Gholipour M, Kordafshari MS, Jahanshahi M, Rahmani AM (2009) A new approach for election algorithm in distributed systems. In 2009 second international conference on Communication Theory, Reliability, and Quality of Service CTRQ’09, IEEE, pp 70–74Google Scholar
  10. 10.
    Basu S (2011) An efficient approach of election algorithm in distributed systems. Indian J Comput Sci Eng (IJCSE) 2(1):16–21Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Department of Computer EngineeringMaharishi Arvind Institute of Engineering and TechnologyJaipurIndia
  2. 2.Poornima College of EngineeringJaipurIndia

Personalised recommendations