Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
An alternative solution to a problem on self-stabilization
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
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
Optimal snap-stabilizing depth-first token circulation in tree networks
Journal of Parallel and Distributed Computing
Self-stabilizing token circulation on uniform trees by using edge-tokens
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
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
We present a simple deterministic distributed depth-first token circulation (DFTC) protocol for arbitrary rooted network. This protocol does not require processors to have identifiers, but assumes the existence of a distinguished processor, called the root of the network. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to converge to the intended behavior in finite time. The proposed protocol stabilizes in O(n) time units, i.e., no more than the time for the token to visit all the processors (in the depth-first search order). It compares very favorably with all previously published DFTC algorithms for arbitrary rooted networks--they all stabilize in O(n 脳 D) times, where D is the diameter of the network.