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
Self-Stabilizing Depth-First Token Passing on Rooted Networks
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
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
An improved snap-stabilizing PIF algorithm
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The first fully polynomial stabilizing algorithm for BFS tree construction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.01 |
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stabilizing depth-first search (DFS) wave protocol for arbitrary rooted networks working under an unfair daemon. However, this protocol needs O(NN) states per processors (where N is the number of processors) and needs ids on processors. In this paper, we propose an original snap-stabilizing solution for this problem with a strongly enhanced space complexity, i.e., O(Δ2 × N) states where Δ is the degree of the network. Furthermore, this new protocol does not need a completely identified network: only the root needs to be identified, i.e., the network is semi-anonymous.