Self-stabilizing algorithms for synchronous unidirectional rings

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 564-573

  Mayer, Alain ^a   Ostrovsky, Rafail ^b   Yung, Moti ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS;

BI-DIRECTIONAL RINGS; LEADER ELECTION; LEADER ELECTION PROTOCOLS; SELF-STABILIZING ALGORITHM; SELF-STABILIZING PROTOCOL; STABILIZATION TIME; UNIDIRECTIONAL RING NETWORK; UNIDIRECTIONAL RINGS;

ROUTERS;

EID: 84941149579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Y. AFEK and G.M. BROWN, Self-stabilizing over unreliable communication media. Distributed Computing, 7:1993 pp. 27-34.
2. Y. AFEK and E. GAFNI, Distributed Algorithms for Unidirectional Networks, SIAM J. on Computing, 1994 pp. 1152-1178.
3. Y. AFEK, S. KUTTEN, and M. YUNG, Memory-efficient self stabilizing protocols for general networks. In Proc. of the 4th Int. Workshop on Distributed Algorithms, Springer-Verlag LNCS, September 1990.
4. B. ALBERT and A.P. JAYASUMANA, FDDI and FDDI-II: Architecture, Protocols, and Performance, Artech House Telecommunication Library, ed. V. Cerf, Artech House, 1994.
5. E. ANAGNOSTOU, R. EL-YANIV, and V. HADZI-LACOS, Memory adaptive self-stabilizing protocols. In Proc. of the 6th Int. Workshop on Distributed Algorithms: Springer-Verlag LNCS, November 1992.
6. D. ANGLUIN, Local and global properties in networks of processors, Proc. 12th ACM Symp. on Theory of Computing (1980), 82-93.
7. B. AWERBUCH, S. KUTTEN, Y. MANSOUR, B. PATT-SHAMIR, and G. VARGHESE, Time optimal self stabilizing synchronization. In Proc. 25th ACM Symp. on Theory of Computing, pages 652-661, May 1993.
8. B. AWERBUCH and R. OSTROVSKY, Memory efficient and self stabilizing network reset. In Proc. of the 14th ACM Symp. on Principles of Distributed Computing, August 1994.
9. B. AWERBUCH, B. PATT-SHAMIR, and G. VARGHESE, Self-stabilization by local checking and correction. In Proc. of the 32nd IEEE Ann. Symp. on Foundation of Computer Science, pages 268-277, October 1991.
10. B. AWERBUCH, and G. VARGHESE, Distributed program checking: a paradigm for building self-stabilizing distributed protocols, Proc. 33nd IEEE Symp. on Foundations of Computer Science (1991), 258-267.
11. R. COLE, and U VISHKIN, Deterministic Coin Tossing and Accelerating Cascades, Proc. 18 ACM Symp. on Theory of Computing, (1986), 206-219.
12. E. W. DIJKSTRA. Self-stabilizing systems in spite of distributed control. Communication of the ACM, 17:643-644, November 1974.
13. S. DOLEV, A. ISRAELI, and S. MORAN. Self-stabilization of dynamic systems assuming only read/write atomicity. In Proc. of the Ninth ACM Symp. on Principles of Distributed Computing, pages 103-118, August 1990.
14. S. DOLEV, A. ISRAELI, and S. MORAN. Uniform dynamic self-stabilizing leader election. In P.G. Spirakis S. Toueg and L. Kirousis, editors, Lecture Notes in Computer Science 579: Proceedings of the fifth Int. Workshop on Distributed Algorithms, pages 163-180. Springer Verlag, October 1991.
15. D. DOLEV, M. KLAWE, and M. RODEH, An O(n log n) Unidirectional Algorithm for Extrema Finding In a Cycle. J. of Algorithms, 3: 245-260, 1982.
16. S. EVEN, A. LITMAN, and P. WINKLER. Computing with Snakes in Directed Network of Automata Proc. 31st IEEE Symp. on Foundations of Computer Science (1990), 740-745.
17. G.N. FREDERICKSON and N. LYNCH, The impact of synchronous communication on the problem of electing a leader. J. of the ACM 34(1) (1987), 98-115.
18. T. HERMAN, Probabilistic self-stabilization, Information Processing Letters 35 (1990), 63-67.
19. N. HONDA and Y. NISHITANI, The Firing Squad Synchronization Problem for Graphs, Theoretical Computer Science, v. 14, 1981, pp. 39-61.
20. A. ISRAELI and M. JALFON, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th ACM Symp. on Principles of Distributed. Computing (1990), 119-130.
21. A. ITAI and M. RODEH, Symmetry breaking in distributive networks, Information and Computation 88 (1990) 60-87.
22. A. ITAI, On the power needed to elect a leader Proc. 41h International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol 486, Springer-Verlag, New York, (1989). 29-40.
23. G. ITKIS, and L LEVIN. Fast and Lean Self-Stabilizing Asynchronous Protocols. In Proc. of the 35th IEEE Ann. Symp. on Foundation of Computer Science, October 1994.
24. S. KATZ and K.J. PERRY, Self-stabilizing extensions for message-passing systems, Distributed Computing 7 (1993), 17-26.
25. S. KUTTEN, Stepwise Construction of Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Networks, The 9-th ICCC, 446-458, 1988.
26. N. LINIAL, Distributive Graph Algorithms-Global Solutions from Local Data. In Proc. of the 28th IEEE Ann. Symp. on Foundation of Computer Science, October 1987, 331-335.
27. A. MAYER, Y. OFEK, R. OSTROVSKY, and M. YUNG, Self-stabilizing symmetry breaking in constant space. In Proc. 24th ACM Symp. on Theory of Computing, May 1992.
28. R. OSTROVSKY and D. WILKERSON Faster Computation On Directed Networks of Automata. In Proc. of Fourteenth Annual ACM Symposium on Principles of Distributed Computing (PODC-95), Ottawa, Ontario, Canada, August 20-23, 1995.
29. R. OSTROVSKY and M YUNG, HOW to withstand mobile virus attacks, Proc. of the 10th ACM Symposium on the Principles in Distributed Computing, 1991, pp. 51-61.
30. G. PARLATI and M YUNG, Non-exploratory self-stabilization for constant-space symmetry-breaking Proc. of the 2d ESA (European Symp. on Algorithms). Springer-Verlag, LNCS 855, 1994, pp. 183-201.
31. G. PETERSON, An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Tran. Prog. Lang. Syst., 4: 758-762, 1982.
32. F.E. ROSE, FDDI - A Tutorial, IEEE Communication Magazine, v. 24, pp. 10-15, May 1986.
33. A.S. TANENBAUM, Computer Networks, 2-d ed. Prentice Hall Software Series, Prentice Hall.
34. P. TETALI and P. WINKLER, On a Random Walk Problem arising in Self-Stabilizing Token Management In Proc. of the 10th ACM Symp. on Principles of Distributed Computing, August 1991.
35. G. VARGHESE. Self-Stabilizing by Counter-Flushing In Proc. of the 14th ACM Symp. on Principles of Distributed Computing, August 1994.