Abstract
This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computing- a rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known. The algorithm assumes asynchronous and reliable FIFO message passing and unique identifiers, and works in dynamic networks and for any network topology.
One of the previous time-optimal algorithms for this task was designed for a model with coarse-grained atomic operations and can be shown not to work properly for the totally asynchronous model (with just “read” or “receive” atomicity, and “write” or “send” atomicity). We revised the algorithm and proved it for a more realistic model of totally asynchronous networks.
The state in the presented algorithm does not stabilize until long after the required output does. For such an algorithm, an increased asynchrony poses much increased hardness in the proof.
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
Abbas, S., Mosbah, M., Zemmari, A.: Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents. In: IEEEIS 2006 (2006)
Afek, Y., Bremler-Barr, A.: Self-stabilizing Unidirectional Network Algorithms by Power-Supply. In: SODA 1997 (1997)
Afek, Y., Kutten, S., Yung, M.: Memory-Efficient Self-Stabilizing Protocols for General Networks. In: van Leeuwen, J., Santoro, N. (eds.) Distributed Algorithms. LNCS, vol. 486. Springer, Heidelberg (1991)
Afek, Y., Kutten, S., Yung, M.: The Local Detection Paradigm and its Applications to Self-Stabilization. In: TCS 1997, vol. 186(1–2) (1997)
Aggarwal, S., Kutten, S.: Time Optimal Self-stabilizing Spanning Tree Algorithms. In: Shyamasundar, R.K. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 761, Springer, Heidelberg (1993)
Arora, A., Gouda, M.G.: Distributed Reset. In: Veni Madhavan, C.E., Nori, K.V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 472, Springer, Heidelberg (1990)
Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time Optimal Self-stabilizing Syncronization. In: STOC 1993 (1993)
Awerbuch, B., Patt-Shamir, B., Varghese, G.: Bounding the Unbounded. In: INFOCOM 1994 (1994)
Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by Local Checking and Correction. In: FOCS 1991 (1991)
Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-stabilization Local Mutual Exclution and Daemon Refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, Springer, Heidelberg (2000)
Bellman, R.: On routing problem. Qurterly of Applied Mathematics 16(1), 87–90 (1958)
Burman, J., Kutten, S.: Time Optimal Asynchronous Self-stabilizing Spanning Tree (extended version), http://tx.technion.ac.il/~bjanna/
Delaët, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators in Unreliable Directed Networks. TR 1361, LRI (2003)
Delaët, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revised. In: JACIC (2006)
Dijkstra, E.W.: Self-stabilization in spite of Distributed Control. Comm. ACM 17, 643–644 (1974)
Dolev, S., Israeli, A., Moran, S.: Resource Bounds for Self-stabilizing Message Driven Protocols. In: PODC 1991 (1991)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of Dynamic Systems Assuming Only Read/Write Atomicity. DC 7, 3–16 (1994)
Dolev, S., Israeli, A., Moran, S.: Uniform Dynamic Self-stabilizing Leader Election (extended abstract). In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) Distributed Algorithms. LNCS, vol. 579. Springer, Heidelberg (1992)
Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. DC 14(3), 147–162 (2001)
Garg, V.K., Agarwal, A.: Distributed Maintenance of A Spanning-Tree Using Labeled Tree Encoding. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648. Springer, Heidelberg (2005)
Gärtner, F.C.: A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms. TR, EPFL (October 2003)
Gärtner, F.C., Pagnia, H.: Time-Efficient Self-stabilizing Algorithms Through Hierarchical Structures. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704. Springer, Heidelberg (2003)
Gupta, S.K.S., Srimani, P.K.: Self-stabilizing Multicast Protocols for Ad Hoc Networks. JPDC 63(1) (2003)
Herault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. TR 1457, LRI (August 2006)
Higham, L., Liang, Z.: Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180. Springer, Heidelberg (2001)
Nesterenko, M., Arora, A.: Stabilization-Preserving Atomicity Refinement. J. Parallel Distrib. Comput. 62(5), 766–791 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burman, J., Kutten, S. (2007). Time Optimal Asynchronous Self-stabilizing Spanning Tree. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)