Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Uniform self-stabilizing ring orientation
Information and Computation
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing ring orientation using constant space
Information and Computation
Self-stabilization
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
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
The Austin Protocol Compiler (Advances in Information Security)
The Austin Protocol Compiler (Advances in Information Security)
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Fast and lean self-stabilizing asynchronous protocols
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Communication Efficiency in Self-Stabilizing Silent Protocols
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Fault masking in tri-redundant systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Algorithms and theory of computation handbook
A state-based model of sensor protocols
Theoretical Computer Science
Hi-index | 0.00 |
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. Leader election is a fundamental building block in distributed computing, enabling to distinguish a unique node, in order to, e.g., execute particular actions. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Ω(log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(n log2 n) time. Our protocol has several attractive features that make it suitable for practical purposes. First, the communication model matches the one that is expected by existing compilers for real networks. Second, the size of the ring (or any upper bound for this size) needs not to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption besides a weak fair scheduler is assumed. Therefore, our result shows that, perhaps surprisingly, trading silence for exponential improvement in term of memory space does not come at a high cost regarding stabilization time, neither it does regarding minimal assumptions about the framework for our algorithm.