International Conference on Concurrency on Concurrency 88
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Self-stabilization
Self-stabilization with r-operators
Distributed Computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
IEEE Transactions on Computers
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Snap-Stabilizing PIF Algorithm in Arbitrary Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Snap-Stabilizing Depth-First Search on Arbitrary Networks
The Computer Journal
| Hi-index | 0.00 |
We propose the first snap-stabilizing wave algorithm for anonymous networks. In the worst case, a process decides in O(n+D) time units, where n and D are the number of process and the diameter of the network, respectively. The proposed algorithm uses a self-stabilizing underlying unison protocol. If the underlying unison is stabilized when a process request a wave, then a decide event occurs in an optimal time, i.e., O(D) time units. The proposed solution is generic in the sense that, it can be used for any static or dynamic scheme which is feasible in an anonymous network. In particular, as an application of our scheme, we provide a snap-stabilizing causal atomic broadcast for anonymous networks, which can be used as a pipeline of messages.