We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
The Self-Stabilizing Edge-Token and Its Applications.
- Authors
SU-SHEN HUNG; SHING-TSAAN HUANG; Tsan-sheng Hsu
- Abstract
Consider a connected graph with nodes (or processes) and edges (or communication links). An edge token associated with an edge is a token maintained by the two nodes connected by the edge; one and only one of the two nodes holds the token. An edge token can be passed from one node to the other if so desired. This paper first presents a randomized self-stabilizing algorithm to implement the edge token, in which each process maintains two three-state variables for an edge; the scheme works under the distributed scheduler with the read/write atomicity. Then, the edge token algorithm is used as a building block in two other self-stabilizing algorithms: one is for ring orientation problem and the other for token circulation problem on trees. All the proposed algorithms are uniform.
- Subjects
SELF-stabilization (Computer science); LOCAL area networks; DECISION trees; COMPUTER algorithms; ALGORITHMS
- Publication
Journal of Information Science & Engineering, 2008, Vol 24, Issue 6, p1859
- ISSN
1016-2364
- Publication type
Article