Self-stabilizing depth-first search
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Fast Self-Stabilizing Depth-First Token Circulation
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Color Optimal Self-Stabilizing Depth-First Token Circulation
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
IEEE Transactions on Software Engineering
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A snap-stabilizing DFS with a lower space requirement
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Snap-Stabilizing detection of cutsets
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
| Hi-index | 0.00 |
A snap-stabilizingprotocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After the end of the visit, the root eventually detects the termination of the process. Furthermore, our protocol is proven assuming an unfair daemon, i.e., assuming the weakest scheduling assumption.