In many distributed systems, we need a leader for coordinating other's members. In this structure, when the leader is crashed, other nodes must elect another leader. Many algorithms for leader election have proposed. In this paper, we introduce a new algorithm for leader election that reduces number of messages rather than other algorithms.
Citation:
Mehdi Mirakhorli, Amir Azim Sharifloo, Maghsoud Abbaspour, "A Novel Method for Leader Election Algorithm," cit, pp.452-456, 7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007