Abstract
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let n and e be the numbers of nodes and edges in a graph, respectively. The time complexity of the proposed algorithm is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings whose length is not a multiple of 3. That is a significant improvement from the best existing results of O(n4) moves for the same problem setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blair, J.R., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)
Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, pp. 290–297. ACM (2002)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974), http://doi.acm.org/10.1145/361179.361202
Goddard, W., Hedetniemi, S.T., Shi, Z., et al.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: Proc. International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 797–803 (2006)
Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. Journal of Parallel and Distributed Computing 70(4), 406–415 (2010)
Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Maximal matching stabilizes in time O(m). Information Processing Letters 80(5), 221–223 (2001)
Hsu, S.C., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Information Processing Letters 43(2), 77–81 (1992)
Karaata, M.H., Saleh, K.A.: Distributed self-stabilizing algorithm for finding maximum matching. Comput. Syst. Sci. Eng. 15(3), 175–180 (2000)
Kimoto, M., Tsuchiya, T., Kikuno, T.: The time complexity of Hsu and Huang’s self-stabilizing maximal matching algorithm. IEEE Trans. Infrmation and Systems E93-D(10), 2850–2853 (2010)
Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. Theoretical Computer Science 412(40), 5515–5526 (2011)
Tel, G.: Introduction to distributed algorithms. Cambridge university press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Asada, Y., Inoue, M. (2015). An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks. In: Rahman, M.S., Tomita, E. (eds) WALCOM: Algorithms and Computation. WALCOM 2015. Lecture Notes in Computer Science, vol 8973. Springer, Cham. https://doi.org/10.1007/978-3-319-15612-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-15612-5_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15611-8
Online ISBN: 978-3-319-15612-5
eBook Packages: Computer ScienceComputer Science (R0)