A belated proof of self-stabilization
Distributed Computing
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information Processing Letters
Leader election in uniform rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing depth-first search
Information Processing Letters
A self-stabilizing leader election algorithm for tree graphs
Journal of Parallel and Distributed Computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
SFS3: a simulation framework for self-stabilizing systems
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
| Hi-index | 0.00 |
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n驴) time starting from any arbitrary initial state. The protocol can elect either a leaf node or a non leaf node (starting from the same initial state) depending on the behavior of the daemon. The protocol generalizes the result in [A self-stabilizing leader election algorithm for tree graphs] and at the same time is muchsimpler and terminates in polynomial number of moves.