J. Villadangos, A. Córdoba, F. Fariña, and M. Prieto (Spain)
leader election, distributed algorithms, complete networks
Leader election is a fundamental problem in distributed computing and it has been studied assuming various com putation models and network topologies. This paper an alyzes the algorithms for leader election in complete net works using asynchronous communication channels. We present a novel algorithm that reduces the information nec essary to select a leader compared with other leader elec tion algorithms for complete networks. In this paper, the algorithm works without sense of direction. It does not require to know the number of nodes in the system. Our proposal requires O(n) messages and O(n) time, where n is the number of nodes in the system, to elect a leader.
Important Links:
Go Back
