Self-stabilizing leader election in optimal space under an arbitrary scheduler
A silent self-stabilizing asynchronous distributed algorithm, SSLE, is given for the leader election problem in a connected unoriented (bidirectional) network with unique IDs. SSLE also constructs a BFS tree on the network rooted at that leader. SSLE uses 0(log n) space per process and stabilizes in 0(n) rounds, against the unfair daemon, where n is the number of processes in the network. (C) 2010 Elsevier B.V. All rights reserved.
self-stabilization leader election distributed algorithm unfair daemon silent algorithm