Self-stabilizing token circulation on uniform trees by using edge-tokens

Authors:
Shing-Tsaan Huang;Su-Shen Hung
Affiliations:
Department of Computer Science and Information Engineering, National Central University, Chung Li, Taiwan, R.O.C;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C
Venue:
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Year:
2003

Citing 12
Cited 0

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A belated proof of self-stabilization

Distributed Computing
Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize

IEEE Transactions on Computers
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Self-Stabilizing Depth-First Token Passing on Rooted Networks

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
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 token circulation in uniform networks

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
Self-stabilizing depth-first token circulation on networks

Distributed Computing - Special issue: Self-stabilization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a self-stabilizing token circulation algorithm for uniform tree networks by using edge tokens. An edge token with respect to an edge is a token maintained by the two nodes connected by the edge; one and only one of the two nodes has the edge token. This paper applies the concept of the edge token to solve the token circulation problem and works under the distributed scheduler with the read/write atomicity. The proposed algorithm only needs O(n) time to stabilize. The result is better than previous works either in stabilizing time or in its elegance.