A robust distributed generalized matching protocol that stabilizes in linear time

Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

Volumn , Issue , 2003, Pages 461-465

  Goddard, W ^a   Hedetniemi, S T ^a   Jacobs, D R ^a   Srimani, P K ^a  

^a South   (United States)

Author keywords

Bandwidth; Computer science; Costs; Delay; Fault tolerant systems; Intelligent networks; Jacobian matrices; Protocols; Robustness; Scheduling algorithm

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SCIENCE; COSTS; DELAY TOLERANT NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; INTELLIGENT NETWORKS; JACOBIAN MATRICES; NETWORK PROTOCOLS; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING ALGORITHMS;

B VALUE; B-MATCHING; DELAY; DISTRIBUTED NETWORKS; FAULT TOLERANT SYSTEMS; LINEAR TIME; MAXIMAL MATCHINGS; SELF-STABILIZING ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 76849102962     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2003.1203595     Document Type: Conference Paper

References (18)

1. M Gradinariu and S Tixeuil. Self-stabilizing vertex coloration and arbritary graphs. In 4th International Conference On Principles Of DIstributed Systems, OPODIS'2000, pages 55-70, 2000.
2. S Dolev and JL Welch. Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46:14-26, 1997.
3. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGrah Hill, 1998.
4. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
5. S. Fujita, T. Kameda, and M. Yamashita. A resource assignment problem on graphs. In Proceedings of the 6th International Symposium on Algorithms and Computation, pages 418-427, Cairns, Australia, December 1995.
6. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Fault tolerant distributed coloring algorithms that stabilize in linear time. In Proceedings of the IPDPS-2002 Workshop on Advances in Parallel and Distributed Computational Models, pages 1-5, 2002.
7. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
8. L. Lamport. Solved problems, unsolved problems, and non-problems in concurrency. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pages 1-11, 1984.
9. M. Schneider. Self-stabilization. ACM Computing Surveys, 25(1):45-67, March 1993.
10. T. Herman. A comprehensive bibliograph on self-stabilization, a working paper. Chicago J. Theoretical Comput. Sci., http://www.cs.uiowa.edu/ftp/selfstab/bibliography.
11. S-C Hsu and S-T Huang. A self-stabilizing algorithm for maximal matching. Information Processing Letters, 43:77-81, 1992.
12. G. Tel. Maximal stabilizes in quadratic time. Information Processing Letters, 49(271-272), 1994.
13. S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Maximal matching stabilizes in time o(m). Information Processing Letters, 80:221-223, 2001.
14. S. Goodman, S. T. Hedetniemi, and R. E. Tarjan. b-matchings in trees. SIAM J. Comput., 5:104-108, 1976.
15. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1994.
16. M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer-Verlag LNCS:1693, pages 254-268, 1999.
17. G Antonoiu and PK Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In Europar'99 Parallel Processing, Proceedings LNCS:1685, pages 823-830, 1999.
18. J Beauquier, AK Datta, M Gradinariu, and F Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer-Verlag LNCS:1914, 2000.