Advertisement

An Adaptive Bully Algorithm for Leader Elections in Distributed Systems

  • Monir AbdullahEmail author
  • Ibrahim Al-Kohali
  • Mohamed OthmanEmail author
Conference paper
  • 323 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11657)

Abstract

Leader election is a classical problem in distributed system applications. There are many leader election algorithms, but we focus here on Bully Algorithm (BA). The main drawback of BA algorithm is the high number of messages passing. In BA algorithm, the message passing has order O (\(n^2\)) that increases heavy traffic on the network. In this paper, an Adaptive BA (ABA) is proposed to reduce the number of messages and make the leader election operation more flexible and safer. The proposed algorithm is based on the Highest Process Identification (HPI) and the Next HPI (NHPI) to facilitate the leader election operation. Moreover, the repetition of the leader election is stopped when the candidate coordinator fails. Our analytical equations show that the ABA algorithm is more efficient rather than BA algorithm, in both, the number of message passing and the latency, and the message passing complexity decreased to O(n).

Keywords

Bully algorithm Election system Message passing 

Notes

Acknowledgment

The authors would like to thank everyone who provided valuable suggestions and support to improve the content of the paper. This research work is partial financially supported by the Malaysian Ministry of Education under the Fundamental Research Grant Scheme (FRGS/1/2018/STG06/UPM/01/2).

References

  1. 1.
    Coulouris, G., Dollimore, J., Kindberg, T., Blair, G.: Distributed System Concept and Design, 5th edn. Addison Wesley, USA (2011)zbMATHGoogle Scholar
  2. 2.
    Garcia-Molina, H.: Elections in a Distributed Computing System. IEEE Trans. Comput. 100(1), 48–59 (1982)CrossRefGoogle Scholar
  3. 3.
    van Steen, M., Tanenbaum, A.S.: Distributed Systems. 3rd edn. CreateSpace Independent Publishing Platform (2017)Google Scholar
  4. 4.
    Murshed, Md.G., Allen, A.R.: Enhanced bully algorithm for leader node election in synchronous distributed systems. J. Comput. 1(1), 3–23 (2012)CrossRefGoogle Scholar
  5. 5.
  6. 6.
    Méndez, M., Tinetti, F.G., Duran, A.M., Obon, D.A., Bartolome, N.G.: Distributed algorithms on IoT devices: bully leader election. In: Proceeding of the International Conference on Computational Science and Computational Intelligence (CSCI), pp. 1351–1355, December 2017Google Scholar
  7. 7.
    Chhabra, S., Tyagi, G., Mundra, A., Rakesh, N.: Location based coordinator election algorithm in distributed environment. In: Proceedings of the International Conference on Computer and Computational Sciences (ICCCS), Noida, pp. 183–188 (2015)Google Scholar
  8. 8.
    Soundarabai, P.B., Sahai, R., Thriveni, J., Venugopal, K.R., Patnaik, L.M.: Improved bully election algorithm for distributed systems. Int. J. Inform. Process. 7(4), 43–54 (2013)Google Scholar
  9. 9.
    Kordafshari, M.S., Gholipour, M., Mosakhani, M., Haghighat, A.T., Dehghan, M.: Modified bully election algorithm in distributed systems. In: Proceedings of the 9th WSEAS International Conference on Computers, Greece, pp. 1–6 (2005)Google Scholar
  10. 10.
    Zargarnataj, M.: New election algorithm based on assistant in distributed systems. In: ACS International Conference on Computer Systems and Applications (AICCSA), Amman, pp. 324–331 (2007)Google Scholar
  11. 11.
    Sepehri, M., Goodarzi, M.: Leader election algorithm using heap structure. In: 12th WSEAS International Conference on Computers, Heraklion, pp. 668–672 (2008)Google Scholar
  12. 12.
    Rahman, M.M., Nahar, A.: Modified bully algorithm using election commission. MASAUM J. Comput. (MJC) 1(3), 439–446 (2009)Google Scholar
  13. 13.
    EffatParvar, M.R., Yazdani, N., EffatParvar, M., Dadlani, A., Khonsari, A.: Improved algorithms for leader election in distributed systems. In: Proceedings of the 2nd International Conference on Computer Engineering and Technology, Chengdu, China (2010)Google Scholar
  14. 14.
    Basu, S.: An efficient approach of election algorithm in distributed systems. Indian J. Comput. Sci. Eng. (IJCSE) 2(1), 16–21 (2011)Google Scholar
  15. 15.
    Park, S.-H.: A stable election protocol based on an unreliable failure detector in distributed systems. In: Proceedings of the 8th International Conference on Information Technology: New Generations, pp. 979–984. IEEE Computer Society (2011)Google Scholar
  16. 16.
    Kordafshari, M M.S., Gholipour, M., Rahmani, A.M., Jahanshahi, M.: A New Approach for Election Algorithm in Distributed System, pp. 70–74 (2009)Google Scholar
  17. 17.
    Mishra, B., Singh, N., Singh, R.: Master-slave group based model for co-ordinator selection, an improvement of bully algorithm. In: Proceedings of the International Conference on Parallel, Distributed and Grid Computing, Solan, India, pp. 457–460 (2014)Google Scholar
  18. 18.
    Garg, D., Suman, N.: Study of assorted election algorithms in distributed operating system. In: Proceedings of the National Conference on Innovative Trends in Computer Science Engineering, pp. 132–134 (2015)Google Scholar
  19. 19.
    Sathesh, B.M.: Optimized bully algorithm. Int. J. Comput. Appl. 121(18), 24–27 (2015)Google Scholar
  20. 20.
    Arghavani, A., Ahmadi, A.E., Haghighat, A.T.: Improved bully election algorithm in distributed systems. In: Proceedings of the 5th International Conference on Information Technology & Multimedia, pp. 14–16 (2011)Google Scholar
  21. 21.
    Fredrickson, G.N., Lynch, N.A.: Electing a leader in asynchronous ring. J. ACM 34(1), 98–115 (1987)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Computer Science DepartmentUniversity of BishaBishaSaudi Arabia
  2. 2.Information Technology DepartmentThamar UniversityDhamarYemen
  3. 3.Laboratory of Computational Science and Mathematical Physics, Institute for Mathematical ResearchUniversiti Putra Malaysia, UPMSerdangMalaysia
  4. 4.Department of Communication Technology and NetworkUniversiti Putra Malaysia, UPMSerdangMalaysia

Personalised recommendations