Self-stabilizing leader election in optimal space under an arbitrary scheduler

Authors:
Ajoy K. Datta;Lawrence L. Larmore;Priyanka Vemula
Affiliations:
-;-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 7
Cited 1

Stabilizing Communication Protocols

IEEE Transactions on Computers - Special issue on protocol engineering
Time optimal self-stabilizing synchronization

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing unidirectional network algorithms by power-supply

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed Reset

IEEE Transactions on Computers
Self-Stabilizing Leader Election in Optimal Space

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems

Brief announcement: self-stabilizing silent disjunction in an anonymous network

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 O(logn) space per process and stabilizes in O(n) rounds, against the unfair daemon, where n is the number of processes in the network.