Non-exploratory self-stabilization for constant-space symmetry-breaking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 855 LNCS, Issue , 1994, Pages 183-201

  Parlati, Giuseppe ^a,b   Yung, Moti ^c  

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

^b UNIVERSITY OF SALERNO   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION COMPLEXITY; LEADER ELECTION; ORIENTED SYSTEMS; RING NETWORKS; SELF STABILIZATION; SELF-STABILIZING ALGORITHM; STABLE SYSTEMS; SYMMETRY-BREAKING;

STABILIZATION;

EID: 84885229903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0049408     Document Type: Conference Paper

References (30)

1. K. Abrahamson, L. Adler, L. Higham, and D. Kirkpatrick, Probabilistic solitude verification on a ring. Proc. 5th ACM Symp. on Principles of Distributed. Computing (1986).
2. Y. Afek and G.M. Brown, Self-stabilization over unreliable communication media, Distrib. Comput., 7: 27–34, 1993. Previous version appeared as: Self-stabilization of the alternating-bit protocol, Proc. 8th IEEE Symp. on Reliable Distributed Systems (1989), 10–12.
3. Y. Afek, S. Kutten, and M. Yung, Memory-efficient self-stabilization on general networks, Proc. 4th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol 486, Springer-Verlag, New York, (1989), 12–28.
4. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese, Time Optimal Self-stabilizing Synchronization, Proc. 25th ACM Symp. on Theory of Computing (1993), 652–661.
5. D. Angluin, Local and global properties in networks of processors, Proc. 12th ACM Symp. on Theory of Computing (1980), 82–93.
6. C. Attiya, M. Snir and M. Warmuth, Computing on an anonymous ring, Journal of the ACM35(4) (1988), 845–875.
7. G.M. Brown, M.G Gouda, and C.L. Wu, Token systems that self-stabilize, IEEE Transactions on Computers 38(6) (1989), 845–852.
8. J.E. Burns and J. Pachl, Uniform self-stabilizing rings, ACM TOPLAS 11(2) (1989), 330–344.
9. W. Bux, F.H. Closs, K. Kümmerle, H.J. Keller and H.R. Müller, Ar-chitecture and design of a reliable token-ring network, IEEE J. on Selected Areas in Comm., 1(5), (1983), 756–765.
10. I. Cidon and Y. Ofek, MetaRing — A full-duplex ring with fairness and spatial reuse, IEEE Transactions on Communications 41(1):110–120 (1993).
11. R. Cohen, and A. Segal, Distributed Priority Algorithms under One-Bit-Delay Constraint Proc. 11th ACM Symp. on Principles of Distributed. Computing (1992), 1–12.
12. E.W. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM 17(11) (1974), 643–644.
13. S. Dolev, A. Israeli and S. Moran, Resource bounds for self stabilizing message driven protocols, Proc. 10th ACM Symp. on Principles of Distributed. Computing (1991), 281–293.
14. 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.
15. T. Herman, Probabilistic self-stabilization, Information Processing Letters 35 (1990), 63–67.
16. A. Hopper and R. M. Needham, The Cambridge fast ring networking system, IEEE Transactions on Computers, 37(10) (1988), 1214–1223.
17. 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.
18. A. Israeli and M. Jalfon, Self-Stabilizing Ring Orientation, Proc. 4th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol 486, Springer-Verlag, New York, (1990), 1–14.
19. A. Itai and M. Rodeh, Symmetry breaking in distributive networks, Information and Computation88 (1990) 60–87.
20. A. Itai, On the power needed to elect a leader Proc. 4th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Vol 486, Springer-Verlag, New York, (1989), 29–40.
21. L. Lamport, Solved problems, unsolved problems and non-problems in concurrency, Proc. 3rd ACM Symp. on Principles of Distributed Computing, (1984), 1–11.
22. L. Lamport and N.A. Lynch, Distributed computing models and methods, Handbook on Theoretical Computer Science, MIT Press/Elsevier, Ed. J. van Leeuwen, 1990, 1159–1199.
23. A. A. Lazar, A. T. Temple and R. Gidron, MAGNET II: A metropolitan area network based on asynchronous time sharing, IEEE J. on Selected Areas in Comm., 8(8), (1990), 1582–1594.
24. C. Lin, and J. Simon, Observing Self-Stabilization Proc. 11th ACM Symp. on Principles of Distributed. Computing (1992), 113–124.
25. A. Mayer, Y. Ofek, R. Ostrovsky and M. Yung, Self-Stabilizing Symmetry Breaking in Constant-Space, Proc. 24th ACM Symp. on Theory of Computing (1992), 667–678.
26. Y. Ofek, Personal communication.
27. H. Ohnishi, N. Morita, and S. Suzuki, ATM ring protocol and performance, Proc. ICC’89, 13.1, (1989), 394–398.
28. J. Pachl, E. Korach and D. Rotem, A technique for proving lower bounds for distributed maximum-finding algorithms, Proc. 14th ACM Symp. on Theory of Computing (1982), 378–382.
29. F. E. Ross, FDDI — a Tutorial, IEEE Communication Magazine, 24(5), (1986), 10–17.
30. P. Vitanyi, Distributed elections in an Archimedian ring of processors, Proc. 16th ACM Symp. on Theory of Computing (1984), 542–547.