Michiko Inoue
ABSTRACT
We present a new self-stabilizing 1-maximal matching algorithm that works under the distributed unfair daemon for arbitrarily shaped networks. Our algorithm is efficient (its stabilization time is O(e) moves, where e denotes the number of edges in the network). Besides, our algorithm is optimal with respect to identifiers locality (we assume node identifiers are distinct up to distance three, a necessary condition to withstand arbitrary networks).
- Yuma Asada, Fukuhito Ooshita, and Michiko Inoue. 2016. An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks. J. Graph Algorithms Appl. 20, 1 (2016), 59--78. https://doi.org/10.7155/jgaa.00384 Google Scholar
Cross Ref
- Jean R. S. Blair and Fredrik Manne. 2003. Efficient self-stabilizing algorithms for tree networks. In Proceedings of 23rd International Conference on Distributed Computing Systems. IEEE, 20--26. https://doi.org/10.1109/ICDCS.2003.1203448 Google ScholarCross Ref
- Subhendu Chattopadhyay, Lisa Higham, and Karen Seyffarth. 2002. Dynamic and self-stabilizing distributed matching. In Proceedings of the twenty-first annual symposium on Principles of distributed computing. ACM, 290--297. https://doi.org/10.1145/571825.571877 Google ScholarDigital Library
- Johanne Cohen, Khaled Maâmra, George Manoussakis, and Laurence Pilard. 2016. Polynomial self-stabilizing maximal matching algorithm with approximation ratio 2/3. In International Conference on Principles of Distributed Systems.Google Scholar
- Ajoy K. Datta, Lawrence L. Larmoreand, and Toshimitsu Masuzawa. 2015. Maximum Matching for Anonymous Trees with Constant Space per Process. In Proceedings of International Conference on Principles of Distributed Systems. 1--16.Google Scholar
- Stéphane Devismes, Toshimitsu Masuzawa, and Sébastien Tixeuil. 2009. Communication efficiency in self-stabilizing silent protocols. In Proceedings of 23rd International Conference on Distributed Computing Systems. IEEE, 474--481. https://doi.org/10.1109/ICDCS.2009.24 Google ScholarDigital Library
- Edsger W. Dijkstra. 1974. Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 11 (1974), 643--644. https://doi.org/10.1145/361179.361202 Google ScholarDigital Library
- Wayne Goddard, Stephen T Hedetniemi, Zhengnan Shi, et al. 2006. An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications. 797--803.Google Scholar
- Nabil Guellati and Hamamache Kheddouci. 2010. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel and Distrib. Comput. 70, 4 (2010), 406--415. https://doi.org/10.1016/j.jpdc.2009.11.006 Google ScholarDigital Library
- Su-Chu Hsu and Shing-Tsaan Huang. 1992. A self-stabilizing algorithm for maximal matching. Inform. Process. Lett. 43, 2 (1992), 77--81. https://doi.org/10.1016/0020-0190(92)90015-N Google ScholarDigital Library
- Michiko Inoue, Fukuhito Ooshita, and Sébastien Tixeuil. 2016. An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers. In International Symposium on Stabilization, Safety, and Security of Distributed Systems. Springer, 195--212. Google ScholarCross Ref
- Mehmet Hakan Karaata and Kassem Afif Saleh. 2000. Distributed self-stabilizing algorithm for finding maximum matching. Computer Systems Science and Engineering 15, 3 (2000), 175--180.Google Scholar
- Fredrik Manne, Morten Mjelde, Laurence Pilard, and Sébastien Tixeuil. 2009. A new self-stabilizing maximal matching algorithm. Theoretical Computer Science 410, 14 (2009), 1336--1345. https://doi.org/10.1016/j.tcs.2008.12.022 Google ScholarDigital Library
- Fredrik Manne, Morten Mjelde, Laurence Pilard, and Sébastien Tixeuil. 2011. A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. Theoretical Computer Science 412, 40 (2011), 5515--5526. https://doi.org/10.1016/j.tcs.2011.05.019 Google ScholarDigital Library
Index Terms
- Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks
Recommendations
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
AbstractWe present the first polynomial self-stabilizing algorithm for finding a 1-maximal matching in a general graph. The previous best known algorithm has been presented by Manne et al. [20] and we show in this paper it has a sub-...
A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks
OPODIS'05: Proceedings of the 9th international conference on Principles of Distributed SystemsSelf-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring ...
Brief announcement: linear time byzantine self-stabilizing clock synchronization
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingWe present the first self-stabilizing Byzantine clock synchronization algorithm that has linear convergence time.
Comments