A Comparative Study of Various Election Algorithms with Election Administration Approach for Distributed System

Abstract

distributed computing systems when coordinator node fails the other nodes of the system need to elect another leader or coordinator to run the system smoothly. The bully algorithm is a classical approach for electing a leader in a distributed computing system. The improvement of the bully algorithm and other modify algorithms requiring less time complexity and minimum message passing over network. The performance analysis of bully and other modify election algorithm with our new proposed algorithm election administration would be appropriate to determine which algorithm performs better than the others. This paper represents the normal case of election in which we compare and discuss our approach with orig inal bully algorithm and existing modified versions of bully algorithm.