A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing depth-first search
Information Processing Letters
The stabilizing token ring in three bits
Journal of Parallel and Distributed Computing
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
IEEE Transactions on Computers
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
Fast Self-Stabilizing Depth-First Token Circulation
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing 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-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
ACM Transactions on Algorithms (TALG)
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Secure token passing at application level
Future Generation Computer Systems
| Hi-index | 0.01 |
We address the depth-first token circulation (DFTC) in tree networks. We first consider oriented trees-every processor knows which of its neighbors leads to a particular processor called the root. On such trees, we propose a state optimal DFTC algorithm. Next, we propose a second algorithm, also for trees, but where no processor knows which of its neighbor leads to the root. This algorithm is also optimal in terms of the number of states per processor. Both algorithms works under any daemon, even unfair. Furthermore, both are snap-stabilizing. A snap-stabilizing protocol guarantees that the system always maintains the desirable behavior. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. Thus, both algorithms are also optimal in terms of the stabilization time. Finally, two approaches of the maximum waiting time to initiate a DFTC are also discussed, whether the tree is oriented or not. In every case but one, we show that the waiting time is asymptotically optimal. In the last case, we conjecture the same result.