Distance- k knowledge in self-stabilizing algorithms

Theoretical Computer Science

Volumn 399, Issue 1-2, 2008, Pages 118-127

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Trevisan, Vilmar ^b  

^a AMRL   (United States)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Algorithm; Irredundant; k packing; Polynomial time; Self stabilizing

Indexed keywords

ALGORITHMS; KNOWLEDGE ENGINEERING; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

K-PACKING; POLYNOMIAL TIME; SELF STABILIZING;

GRAPH THEORY;

EID: 42749084247     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.02.009     Document Type: Article

References (12)

1. J. Beauquier, S. Cordier, S. Delaët, Optimum probabilistic self-stabilization on uniform rings, in: Proceedings of the Second Workshop on Self-Stabilizing Systems, 1995, pp. 15.1-15.15
2. Boulinier C., Petit F., and Villain V. When graph theory helps self-stabilization. PODC '04: Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Domputing. St. John's (2004), ACM Press, New York 150-159
3. Cantarell S., Datta A.K., Petit F., and Villain V. Token based group mutual exclusion for asynchronous rings. 21st International Conference on Distributed Computing Systems. ICDCS, Apr 2001 (2001), Mesa 691-694
4. Danturi P., Nesterenko M., and Tixeuil S. Self-stabilizing philosophers with generic conflicts. 8th International Symposium Stabilization, Safety, and Security of Distributed Systems. SSS November 2006, Dallas. In: Datta A.K., and Gradinariu M. (Eds). Lecture Notes in Computer Science vol. 4280 (2006)
5. Dijkstra E.W. Self-stabilizing systems in spite of distributed control. Comm. ACM 17 11 (1974) 643-644
6. Dolev S. Self-Stabilization (2000), MIT Press
7. Gairing M., Goddard W., Hedetniemi S.T., Kristiansen P., and McRae A.A. Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14 (2004) 387-398
8. Goddard W., Hedetniemi S.T., Jacobs D.P., and Trevisan V. Distance-k information in self-stabilizing algorithms. 13th Colloquium on Structural Information and Communication Complexity. SIROCCO, Chester, July 2006. LNCS vol. 4056 (2006) 349-356
9. Haynes T.W., Hedetniemi S.T., and Slater P.J. Fundamentals of Domination in Graphs (1998), Marcel Dekker, New York
10. Manne F., and Mjelde M. A memory efficient self-stabilizing algorithm for maximal k-packing. 8th International Symposium Stabilization, Safety, and Security of Distributed Systems. SSS November 2006, Dallas. In: Datta A.K., and Gradinariu M. (Eds). Lecture Notes in Computer Science vol. 4280 (2006)
11. Nesterenko M., and Arora A. Stabilization-preserving atomicity refinement. J. Parallel Distributed Comput. 62 5 (2002) 766-791
12. S.K. Shukla, D.J. Rosenkrantz, S.S. Ravi, Observations on self-stabilizing graph algorithms for anonymous networks, in: Proceedings of the Second Workshop on Self-Stabilizing Systems, 1995, pp. 7.1-7.15