Abstract
Given two functions f and g mapping nodes to non-negative integers, we give a silent self-stabilizing algorithm that computes a minimal (f, g)-alliance in an asynchronous network with unique node IDs, assuming that every node p has a degree at least g(p) and satisfies f(p) ≥ g(p). Our algorithm is safely converging in the sense that starting from any configuration, it first converges to a (not necessarily minimal) (f, g)-alliance in at most four rounds, and then continues to converge to a minimal one in at most 5n + 4 additional rounds, where n is the size of the network. Our algorithm is written in the shared memory model. It is proven assuming an unfair (distributed) daemon. Its memory requirement is O(log n) bits per process, and it takes \(O(\varDelta^3n)\) steps to stabilize, where \(\varDelta\) is the degree of the network.
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.
Similar content being viewed by others
References
Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279–304 (2007)
Dijkstra, E.W.: Self-Stabilizing Systems in Spite of Distributed Control. Commun. ACM 17, 643–644 (1974)
Dolev, S., Gouda, M.G., Schneider, M.: Memory Requirements for Silent Stabilization. In: PODC, pp. 27–34 (1996)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. (1997)
Dourado, M.C., Penso, L.D., Rautenbach, D., Szwarcfiter, J.L.: The south zone: Distributed algorithms for alliances. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 178–192. Springer, Heidelberg (2011)
Genolini, C., Tixeuil, S.: A lower bound on dynamic k-stabilization in asynchronous systems. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), October 13-16. IEEE Computer Society, Osaka (2002)
Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, May 23-26, pp. 45–54. ACM, Philadelphia (1996)
Gupta, A., Maggs, B.M., Oprea, F., Reiter, M.K.: Quorum placement in networks to minimize access delays. In: Aguilera, M.K., Aspnes, J. (eds.) Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, July 17-20, pp. 87–96. ACM, Las Vegas (2005)
Kakugawa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: IPDPS (2006)
Kamei, S., Kakugawa, H.: A self-stabilizing approximation for the minimum connected dominating set with safe convergence. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 496–511. Springer, Heidelberg (2008)
Kamei, S., Kakugawa, H.: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. Theoretical Computer Science 428, 80–90 (2012)
Kutten, S., Patt-Shamir, B.: Time-adaptive self stabilization. In: Burns, J.E., Attiya, H. (eds.) Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, August 21-24, pp. 149–158. ACM, Santa Barbara (1997)
Srimani, P.K., Xu, Z.: Distributed protocols for defensive and offensive alliances in network graphs using self-stabilization. In: ICCTA, pp. 27–31 (2007)
Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf. Process. Lett. 103(3), 88–93 (2007)
Wang, G., Wang, H., Tao, X., Zhang, J.: A self-stabilizing algorithm for finding a minimal K-dominating set in general networks. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds.) ICDKE 2012. LNCS, vol. 7696, pp. 74–85. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Carrier, F., Datta, A.K., Devismes, S., Larmore, L.L., Rivierre, Y. (2013). Self-stabilizing (f,g)-Alliances with Safe Convergence. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2013. Lecture Notes in Computer Science, vol 8255. Springer, Cham. https://doi.org/10.1007/978-3-319-03089-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-03089-0_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03088-3
Online ISBN: 978-3-319-03089-0
eBook Packages: Computer ScienceComputer Science (R0)