A leader election algorithm in a distributed computing system

A leader election algorithm based on the performance and the operation rate of nodes and links as proposed. The performance of the existing leader election algorithms should be improved because a distributed system pauses until a node becomes a unique leader among all nodes in the system. The pre-election algorithm that elects a provisional leader while the leader is executing is also introduced.

[1]  Shing-Tsaan Huang,et al.  Leader election in uniform rings , 1993, TOPL.

[2]  Suresh Singh.  Expected Connectivity and Leader Election in Unreliable Networks , 1992, Inf. Process. Lett..

[3]  Suresh Singh,et al.  Electing leaders based upon performance: the delay model , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[4]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[5]  R. Newman-Wolfe,et al.  An optimal distributed algorithm for failure-driven leader election in bounded-degree networks , 1992, Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems.

[6]  Gurdip Singh.  Real-Time Leader Election , 1994, Inf. Process. Lett..

[7]  C. H. Elphick.  Graph Theory in Operations Research , 1982 .