An [formula omitted]-time self-stabilizing leader election algorithm

Abstract

A self-stabilizing asynchronous distributed leader election algorithm is presented. The algorithm works for any connected unoriented (bidirectional) network with unique IDs. The solution also constructs a BFS tree of the network rooted at the elected leader. The proposed solution is silent and works under the unfair daemon. The algorithm stabilizes in O ( n ) rounds, where n is the number of processes in the network.