Predictable Leader Election Algorithm

The existing leader election algorithm can be characterized by the extrema-finding algorithm in which all nodes are assumed to have a unique ID number. The leader to be elected is the node simply having the largest ID number. In this paper, the leader election algorithm which is based upon the performance and operation rate of nodes and links is proposed. The per formance of the existing leader election algorithms should be improved because the system pauses until a node becomes a unique leader among all nodes in the system. The pre-election algorithm which elects a leader while leader is running is also proposed.

[1]  Suresh Singh,et al.  Electing "Good" Leaders , 1994, J. Parallel Distributed Comput..

[2]  Maw-Sheng Chern,et al.  Network partition and its application to distributed selection problem , 1991, [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications.

[3]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[4]  Oliver D. Anderson.  Graph Theory in Operations Research , 1982 .

[5]  Sape Mullender,et al.  Distributed systems , 1989 .

[6]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[7]  Uyless Black.  TCP/IP and Related Protocols , 1991 .

[8]  Arnold O. Allen.  Probability, Statistics, and Queueing Theory , 1978 .

[9]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[10]  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.

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

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