Self-stabilizing graph protocols

Parallel Processing Letters

Volumn 18, Issue 1, 2008, Pages 189-199

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Srimani, Pradip K ^a   Xu, Zhenyu ^a  

^a Clemson University   (United States)

Author keywords

Distributed daemon; Fault tolerance; Graph algorithms; Self stabilizing protocol

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; GRAPH THEORY; OPTIMIZATION; SELF ADJUSTING CONTROL SYSTEMS;

DISTRIBUTED DAEMON; GRAPH ALGORITHMS; SELF-STABILIZING PROTOCOL;

NETWORK PROTOCOLS;

EID: 44349161710     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626408003314     Document Type: Conference Paper

References (15)

1. H. Abu-Amara, B. Coan, S. Dolev, A. Kanevsky, and J.L. Welch. Self-stabilizing topology maintenance protocols for high-speed networks. IEEE/ACM Transactions on Networking 4 (1996), 902-912.
2. H. Attiya and J. Welch. Distributed Computing: Fundamentals. Simulations and Advanced Topics. (McGraw Hill, 1998).
3. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater. Fundamentals of Domination in Graphs, volume 208 of Monographs and Textbooks in Pure and Applied Mathematics. (Marcel Dekker Inc., New York, 1998).
4. S. Fujita, T. Kameda, and M. Yamashita. A resource assignment problem on graphs. In Proceedings of the 6th International Symposium on Algorithms and Computation (Cairns, Australia, December 1995), 418-427.
5. E.W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17 (1974), 643-644.
6. S. Dolev. Self-Stabilization. (MIT Press, 2000).
7. S.C. Hsu and S.T. Huang. A self-stabilizing algorithm for maximal matching. Information Processing Letters 43 (1992), 77-81.
8. S.K. Shukla, D.J. Rosenkrantz, and S.S. Ravi. Observations on self-stabilizing graph algorithms for anonymous networks. In Proceedings of the Second Workshop on Self-Stabilizing Systems (1995), 7.1-7.15.
9. Y. Afek and S. Dolev. Local stabilizer. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (1997), 74-84.
10. J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium (Springer LNCS:1914, 2000), 223-237.
11. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Self-stabilizing algorithms for orderings and colorings. Int. J. Found. Comput. Sci. 16 (2005), 19-36.
12. S. Shukla, D. Rosenkrantz, and S. Ravi. Developing self-stabilizing coloring algorithms via systematic randomization. In Proceedings of the International Workshop on Parallel Processing (1994), 668-673.
13. W. Goddard, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In Proceedings of 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models (Nice 2003), 162.
14. Z. Xu, S.T. Hedetniemi, W. Goddard, and P.K. Srimani. A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In Distributed Computing - IWDC 2003, 5th International Workshop (Kolkata, India, Springer LNCS:2918, 2003), 26-32.
15. M. Ikeda, S. Kamei, and H. Kakugawa. A space-optimal self-stabilizing algorithm for the maximal independent set problem. In PDCAT Proc. 3rd Int. Conf. Parallel and Distributed Computing, Applications and Technologies (2002), 70-74.