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.
Allen, A.O.1978. Probability, Statistics, and Queueing Theory, Los Angeles: Academic Press.
2.
Awerbuch, B.1985. "Complexity of Network Synchronization ," Journal of ACM, 32(4):804-823.
3.
Boffey, T.B.1982. Graph Theory in Operations Research. Hong Kong: Macmillan Press Ltd.
4.
Black, U.1992. TCP/IP and Related Protocols. Tokyo : McGraw-Hill Inc.
5.
Gusella, R. and S. Zatti.1985. "The Berkeley UNIX 4.3 BSD Time Synchronization Protocol: Protocol Specification," Technical Report, CSD85-250, University of California.
6.
Hu, Jyun, et al. 1991. "Network Partition and Its Application to Distributed Selection Problem," in Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications, Scottsdale.
7.
Morina, H.G.1982. "Election in a Distributed Computing System," IEEE TX on Computers, C-31(1):48-59.
8.
Mullender, S.1989. Distributed Systems, New York : ACM Press, Addison-Wesley Publishing Company.
9.
Francis, Richard L., et al. 1992. Facility Layout and Location: An Analytical Approach, Englewood Cliffs: Prentice Hall Inc.
10.
Ross, S.M.1982. Introduction to Probability Models. New York: Academic Press Inc.
11.
Singh, G.1994. "Real-Time Leader Election," Information Processing Letters, 49:59-61.
12.
Singh, S. and James F. Kuros.1994. "Electing 'Good' Leaders," Journal of Parallel and Distributed Computing, 21:184-201.
13.
Taiwoo, K., K. Joongkwon and K. Taiyun.1994. "A Study on the Leader Election Algorithm in Distributed System," Proceedings of the 21st KISS Fall Conference, Seoul.
14.
Taiwoo, K. and K. Taiyun.1995. "A Pre-election Algorithm in the Distributed Computing System," submitted to Journal of the Korean Institute of Communications Sciences.
15.
Yuan-Chieh, C. , et al. 1992. "An Optimal Distributed Algorithm for Failure-Driven Leader Election in Bounded-Degree Networks," Proceedings for 3rd IEEE Workshop on FTDCS, Taipei.
