This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States
June 1998 (vol. 9 no. 6)
pp. 579-584

Abstract—A distributed system is said to be self-stabilizing 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 n of processors is even. Provided that n 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 63 = 216 in the link-register model.

[1] M. Schneider, “Self-Stabilization,” ACM Computing Surveys, vol. 25, no. 1, pp. 45-67, Mar. 1993.
[2] E.W. Dijkstra,“Self-stabilizing systems in spite of distributed control,” Comm. ACM, vol. 17, no. 11 pp. 643-644, 1974,.
[3] J.E. Burns and J. Pachl,“Uniform self-stabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989,.
[4] A. Israeli and M. Jalfon,“Token management schemes and random walks yield self-stabilizing mutual exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computation,Quebec City, Aug. 1990, pp. 119-132.
[5] T. Herman, "Probabilistic Self-Stabilization," Information Processing Letters, vol. 35, no. 2, pp. 63-67, June 1990.
[6] N. Nishikawa, T. Masuzawa, and N. Tokura, "Uniform Self-Stabilizing Algorithms for Mutual Exclusion," Inst. Electronics, Information and Communication Engineers, Japan, vol. J75-D-I, no. 4, pp. 201-209, Apr. 1992.
[7] S.T. Huang, “Leader Election in Uniform Rings,” ACM Trans. Programming Languages and Systems, vol. 15, pp. 563-573, 1993.
[8] J. Beauquier and S. Delaët, "Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings," Proc. 13th Ann. ACM Symp. Principles of Distributed Computing, p. 378, 1994.
[9] H. Kakugawa and M. Yamashita, "Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 2, pp. 154-163, Feb. 1997.
[10] J. Beauquier and S. Delaët, "Optimum Probabilistic Self-Stabilization on Uniform Rings," Proc. Second Workshop Self-Stabilizing Systems, 1995, see also technical report, Dept. of Computer Science, Univ. of Nevada, Las Vegas, 1995.
[11] A. Israeli and M. Jalfon,“Self-stabilizing ring orientation,” Lecture Notes in Computer Science 486: Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds., pp. 1-14, Springer-Verlag, 1991.
[12] T. Masuzawa, Y. Katayama, and N. Tokura, "Self-Stabilizing Algorithm for Ring Orientation," Information Processing Soc. Japan SIG Algorithms Technical Report, vol. 25, no. 8, 1992.
[13] A. Israeli and M. Jalfon, "Uniform Self-Stabilizing Ring Orientation," Information and Computation, vol. 104, pp. 175-196, 1993.
[14] J.-H. Hoepman, "Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings," Proc. Eighth Int'l Workshop Distributed Algorithms, pp. 265-279, 1994.
[15] M.-S. Tsai and S.-T. Huang, "Self-Stabilizing Ring Orientation Protocols," Proc. Second Workshop Self-Stabilizing Systems, 1995, see also technical report, Dept. of Computer Science, Univ. of Nevada, Las Vegas, 1995.
[16] N. Uemoto, H. Kakugawa, and M. Yamashita, "A Self-Stabilizing Ring Orientation Algorithm with Finite Number of States," RIMS Kokyuroku 906, pp. 257-263.Kyoto, Japan: Research Inst. of Math. Science at Kyoto Univ., Apr. 1995.

Index Terms:
Distributed algorithm, self-stabilization, fault-tolerance, ring network, ring orientation.
Citation:
Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita, "A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 6, pp. 579-584, June 1998, doi:10.1109/71.689445
Usage of this product signifies your acceptance of the Terms of Use.