Leader election in complete networks.

Leader election in complete networks.

Leader election is a fundamental problem in distributed computing and has a number of applications. This paper studies the problem of leader election in complete asynchronous networks. We present a message-optimal protocol that requires O (N log N) messages and O (N/log N) time, where N is the numbe...

Full description

Bibliographic Details
Published in:SIAM journal on computing. 26, 3 (1997).
Main Author: Singh, Gurdip
Format: Article
Language:English
Subjects:
Distributed algorithms.
Leader election.
Time complexity.
Complete networks.