The local detection paradigm and its applications to self-stabilization 1

Theoretical Computer Science

Volumn 186, Issue 1-2, 1997, Pages 199-229

  Afek, Yehuda ^c   Kutten, Shay ^a   Yung, Moti ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

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

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; TREES (MATHEMATICS);

LOCAL DETECTION PARADIGM; ROOTED SPANNING TREE; SELF STABILIZING DISTRIBUTED ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031246550     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00286-1     Document Type: Article

References (44)

1. Y. Afek, B. Awerbuch, E. Gafni, Applying static network protocols to dynamic networks, in: Proc. 28th IEEE Ann. Symp. on Foundation of Comput. Sci., October 1987, Los Angeles, CA, pp. 358-370.
2. Y. Afek, G.M. Brown, Self-stabilization over unreliable communication media, Distributed Comput. J. 7 (1993) 27-34.
3. Y. Afek, E. Gafni, A. Rosen, The slide mechanism with applications in dynamic networks, in: Proc. 11th ACM Symp. on Principles of Distributed Computing (1992), Vancouver, BC, Canada, pp. 35-46.
4. Y. Afek, S. Kutten, M. Yung, Memory-efficient self stabilizing protocols for general networks, in: Proc. 4th Internet. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer, Berlin, 1990.
5. Y. Afek, Y. Matias, Elections in anonymous networks, Inform, and Comput. (formerly Inform, and Control) 113 (September 1994) 312-330.
6. S. Aggarwal, Time optimal self-stabilizing spanning tree algorithms, M.Sc Thesis, MIT, May 1994.
7. E. Anagnostou, R. El-Yaniv, V. Hadzilacos, Memory adaptive self-stabilizing protocols, in: Proc. 6th Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science, Springer, Berlin, 1992.
8. D. Angluin, Local and global properties in networks of processes, in: Proc. 12th Ann. ACM Symp. on Theory of Computing (May 1980), Los Angeles, pp. 82-93.
9. A. Arora, M. Gouda, Distributed reset, in: Proc. 10th FSTTCS, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 316-331.
10. B. Awerbuch, Complexity of network synchronization, J. ACM 32 (October 1985) 804-823.
11. B. Awerbuch, I. Cidon, S. Kutten, Communication-optimal maintenance of replicated information, in: Proc. 31st IEEE Ann. Symp. on Foundation of Computer Science (October 1990) pp. 492-502.
12. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, G. Varghese, Time optimal self stabilizing synchronization, in: Proc. 25th ACM Symp. on Theory of Computing (May 1993) pp. 652-661.
13. B. Awerbuch, R. Ostrovsky, Memory efficient and self stabilizing network reset, in: Proc. 14th ACM Symp. on Principles of Distributed Computing (PODC) (August 1994).
14. B. Awerbuch, B. Patt-Shamir, G. Varghese, Self-stabilization by local checking and correction, in: Proc. 32nd IEEE Ann. Symp. on Found. of Computer Sci. (October 1991) pp. 268-277.
15. B. Awerbuch, B. Patt-Shamir, G. Varghese, S. Dolev, Self stabilization by local checking and global reset, in: Proc. WDAG 94, Lecture Notes in Computer Science, Springer, Berlin, 1994, pp. 226-239.
16. B. Awerbuch, G. Varghese, Distributed program checking: a paradigm for building self-stabilizing distributed protocols, in: Proc. 32nd IEEE Ann. Symp. on Found, of Comput. Sci. (October 1991) pp. 258-267.
17. G.M. Brown, M.G. Gouda, C.-L. Wu, Token systems that self-stabilize, IEEE Trans. Comput. c38 (1989) 845-852.
18. J. Burns, J. Pachl, Uniform self-stabilizing rings, ACM Trans. Programm. Languages Systems 11 (1989) 330-344.
19. E.J. Chang, Decentralized Algorithms in Distributed Systems, Ph.D. thesis, University of Toronto, October 1979.
20. D. Coppersmith, P. Tetali, P. Winkler, Collisions among random walks on a graph, in: SIAM J. Disc. Math. 6 (August 1993) 363-374. Abstract in Proc. 10th ACM Symp. on Principles of Distributed Computing (August 1991) pp. 273-280.
21. D. Coppersmith, P. Tetali, P. Winkler, Collisions among random walks on a graph, in: SIAM J. Disc. Math. 6 (August 1993) 363-374. Abstract in Proc. 10th ACM Symp. on Principles of Distributed Computing (August 1991) pp. 273-280.
22. E.W. Dijkstra, Self-stabilizing systems in spite of distributed control, Comm. ACM 17 (November 1974) 643-644.
23. S. Dolev, A. Israeli, S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Comput. J. 7 (1994). Also in: Proc. 9th ACM Symp. on Principles of Distributed Comput. (August 1990).
24. S. Dolev, A. Israeli, S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Comput. J. 7 (1994). Also in: Proc. 9th ACM Symp. on Principles of Distributed Comput. (August 1990).
25. S. Dolev, A. Israeli, S. Moran, Uniform dynamic self-stabilizing leader election, in: P.O. Spirakis, S. Toueg, L. Kirousis (Eds.), Lecture Notes in Computer Science, Vol. 579: Proc. 5th Internat. Workshop on Distributed Algorithms, Springer, Berlin, October 1991, pp. 163-180.
26. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum weight spanning trees, ACM Trans. Program. Lang. Syst. 5 (January 1983) 66-77.
27. M.G. Gouda, R.R. Howell and L.E. Rosilk, The instability of self-stabilization. Extended Abstract, Acta Informatica Vol. 27, 1990.
28. M.G. Gouda, N. Multari, Stabilizing Communication Protocols, IEEE Trans. Comput. 40 (1991) 448-458.
29. A. Israeli, M. Jalfon, Token management schemes and random walks yield self-stabilizing mutual exclusion, in: Proc. 9th ACM Symp. on Principles of Distributed Computing (August 1990), pp. 119-132.
30. G. Itkis, L. Levin, Fast and lean self-stabilizing asynchronous protocols, Proc. 35th IEEE Ann. Symp. on Found, of Comput. Sci. (1994) pp. 226-239.
31. S. Katz, K.J. Perry, Self-stabilizing extensions, Distributed Computing Journal (1994) 7. Also in: Proc. 9th ACM Symp. on Principles of Distributed Computing (1990).
32. S. Katz, K.J. Perry, Self-stabilizing extensions, Distributed Computing Journal (1994) 7. Also in: Proc. 9th ACM Symp. on Principles of Distributed Computing (1990).
33. H.S.M. Kruijer, Self-stabilization (in spite of distributed control) in tree-structured systems, Inform. Process. Lett. (1979) 91-95.
34. A. Mayer, M. Naor, L. Stockmeyer, Local computations on static and dynamic graphs, in: Proc. IEEE 3rd Israeli Symp. on Theory of Computing and Systems, 1995, 268-278.
35. A. Mayer, Y. Ofek, R. Ostrovsky, M. Yung, Self-stabilizing symmetry breaking in constant space, in: Proc. 24th ACM Symp. on Theory of Computing (May 1992) pp. 667-678.
36. A. Mayer, R. Ostrovsky, M. Yung, Self-stabilizing algorithms for synchronous unidirectional rings, in: Proc. 7th SIAM-ACM Symp. on Discrete Algorithms (1996).
37. M. Naor, L. Stockmeyer, What can be computed locally, in: Proc. 25th ACM Symp. on Theory of Computing, ACM, May 1993, pp. 185-193.
38. G. Parlati, M. Yung, Non-exploratory self-stabilization for constant-space symmetry-breaking, in: J. Van Leewen (Ed.), Proc. 2d European Symp. on Algorithms ESA'94, Lecture Notes in Computer Science, Vol. 855.
39. Schieber, Snir, Calling names on nameless networks, Information and Computation (formerly Information and Control) (1994) 113. Also in: Proc. ACM Symp. on Principles of Distributed Computing (August 1989) 319-328.
40. Schieber, Snir, Calling names on nameless networks, Information and Computation (formerly Information and Control) (1994) 113. Also in: Proc. ACM Symp. on Principles of Distributed Computing (August 1989) 319-328.
41. A. Segall, Distributed network protocols, IEEE Trans. Inform. Theory IT-29 (1) (January 1983) 23-35.
42. J. Spinelli, R.G. Gallager, Broadcast topology information in computer networks, IEEE Trans. Comm. (1989).
43. F.A. Stomp, Structured design of self-stabilizing programs, in: Proc. IEEE 2nd Israeli Symp. on Theory of Comput. Systems (June 1993) 167-176.
44. G. Varghese, Dealing with Failure in Distributed Systems, Ph.D. thesis, MIT, Department of Electrical Engineering and Computer Science, 1992.