Issue No. 06 - June (1998 vol. 9)

ISSN: 1045-9219

pp: 579-584

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.689445

ABSTRACT

<p><b>Abstract</b>—A distributed system is said to be <it>self-stabilizing</it> if it will eventually reach a legitimate system state regardless of its initial state. Because of this property, a self-stabilizing system is extremely robust against failures; it tolerates any finite number of transient failures. The ring orientation problem for a ring is the problem of all the processors agreeing on a common ring direction. This paper focuses on the problem of designing a deterministic self-stabilizing ring orientation system with a small number of processor states under the distributed daemon. Because of the impossibility of symmetry breaking, under the distributed daemon, no such systems exist when the number <it>n</it> of processors is even. Provided that <it>n</it> is odd, the best known upper bound on the number of states is 256 in the link-register model, and eight in the state-reading model. We improve the bound down to 6<super>3</super> = 216 in the link-register model.</p>

INDEX TERMS

Distributed algorithm, self-stabilization, fault-tolerance, ring network, ring orientation.

CITATION

N. Umemoto, H. Kakugawa and M. Yamashita, "A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States," in

*IEEE Transactions on Parallel & Distributed Systems*, vol. 9, no. , pp. 579-584, 1998.

doi:10.1109/71.689445

CITATIONS