Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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–6
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
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–33
Soundarabai PB, Sahai R, Thriveni J, Venugopal KR, Patnaik LM (2014) Improved bully election algorithm for distributed systems. Int J Emerg Technol
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, Austria
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)
Soundarabai PB, Sahai R, Thriveni J, Venugopal KR, Patnaik LM (2014) Improved bully election algorithm for distributed systems. Int J Emerging Technol
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–360
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–74
Basu S (2011) An efficient approach of election algorithm in distributed systems. Indian J Comput Sci Eng (IJCSE) 2(1):16–21
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Surolia, J., Bundele, M.M. (2020). Design and Analysis of Modified Bully Algorithm for Leader Election in Distributed System. In: Mathur, G., Sharma, H., Bundele, M., Dey, N., Paprzycki, M. (eds) International Conference on Artificial Intelligence: Advances and Applications 2019. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-15-1059-5_38
Download citation
DOI: https://doi.org/10.1007/978-981-15-1059-5_38
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1058-8
Online ISBN: 978-981-15-1059-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)