A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Volumn , Issue , 2003, Pages 720-724

  Kamei, Sayaka ^a   Kakugawa, Himtsugu ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Fault tolerance; Minimal dominating set; Minimal redundant dominating set; Self stabilizing distributed algorithm; Tree networks

Indexed keywords

MINIMAL DOMINATING SETS; TREE NETWORKS;

ALGORITHMS; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING; SERVERS;

TREES (MATHEMATICS);

EID: 1642529566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2003.1236399     Document Type: Conference Paper

References (11)

1. E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control", Communications of the ACM, 17(11): 643-644, 1974.
2. S. K. Shukla, D. J. Rosenkrantz, and S. S. Ravi, "Observation on self-stabilizing graph algorithms for anonymous networks", Proceedings of the second workshop on self-stabilizing systems, 1995.
3. M. Schneider, "Self-stabilization", ACM Computing Surveys, Vol. 25, pp. 45-67, Mar. 1993.
4. F. C. Gartner, "Fundamentals of fault-tolerant distributed computing in asynchronous environments", ACM Computing Surveys, 35: 43-48, 1996.
5. H. Kakugawa and M. Yamashita, "Self-stabilizing local mutual exclusion on networks in which process identifiers and not distinct", Proceedings of the 21th Symposium on Reliable Distributed Systems (SRDS), pages 202-211, 2002.
6. th Conference on Distributed Computing (DISC), Lectuer Notes in Computer Science 2180, pages 240-254. Springer-Verlag, 2000.
7. M. Gradinariu and S. Tixeuil, "Self-stabilizing vertex coloring of arbitrary graphs", Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), pages 55-70, 2000.
8. G. Antonoiu and P. K. Srimani, "Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity", Proceedings of EURO-PAR'98 Parallel Proceeding, 1998.
9. G. Antonoiu and P. K. Srimani, "Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity", Proceedings of EURO-PAR'99 Parallel Processing, 1999.
10. J. L. W. Kessels, "An exercise in proving self-stabilization with a variant function", Information Processing Letters, 29 (1): 39-42, Sept. 1988.
11. M. Yamashita and T. Kameda, "Leader election problem on networks in which processor identity numbers are not distinct", IEEE Transactions on Parallel and Distributed Systems, Vol. 10, pp. 878-889, 1999.