A New Approach for Election Algorithm in Distributed Systems

Leader election is an important problem in distributed computing systems. In this problem, when the leader is crashed, other nodes must elect another leader. Garcia-Molinapsilas Bully Algorithm is a classic solution to cope with this problem. In this paper we introduce a new method based on electing a leader and alternatives. If the leader crash, the alternative takes, care of the leader´s responsibilities. Our results revealed that often, after a leader crash, leader alternative elect as a leader and continue to work. increases. We show that our proposed algorithm is more efficient than the Garcia Molinapsilas one in term of time, message complexity and in the fewer stages.