SIAM Journal on Applied Mathematics
Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Elections in anonymous networks
Information and Computation
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The fault span of crash failures
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
Synchronizing Aysnchronous Bounded Delay Networks
Proceedings of the 2nd International Workshop on Distributed Algorithms
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Maintaining Digital Clocks In Step
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
The power of epidemics: robust communication for large-scale distributed systems
ACM SIGCOMM Computer Communication Review
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
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
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Silence is golden: self-stabilizing protocols communication-efficient after convergence
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Communication-Efficient self-stabilization in wireless networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Most self-stabilizing protocols rely on checking every neighbor of a node continuously to detect failures. Such protocols have a high communication cost, especially in dense graphs. Conceivably, one can check neighbors less often, reducing the amount of communication per round. However, delaying the checking delays the fault detection and the stabilization, and therefore has the potential of increasing the total amount of communication overhead until stabilization. In this paper, we strive to reduce "after stabilization" overhead, without increasing the "before stabilization" overhead. For that, we investigate the potential effect of randomization on the communication efficiency of self-stabilizing protocols. We present randomized low communication self-stabilizing algorithms for several major tasks, namely, spanning tree construction, distributed reset, and unison. We study this approach in a complete graph, since there the communication overhead of checking seems the highest when one strives for protocols that are also fast.