Self-Stabilizing Leader Election in Optimal Space
A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(logn) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.
KeywordsDistributed algorithm leader election self-stabilization
Unable to display preview. Download preview PDF.
- 1.Afek, Y., Bremler, A.: Self-Stabilizing Unidirectional Network Algorithms by Power-Supply. In: 8th Annual ACM Symposium on Discrete Algorithms, pp. 111–120 (1997)Google Scholar
- 3.Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time Optimal Self-stabilizing Synchronization. In: 25th Annual ACM Symposium on Theory of Computing, pp. 652–661 (1993)Google Scholar