Abstract
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n 2) rounds. Thus, this algorithm improves the convergence time of all previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a factor O(logn). The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only O(log2 n) bits.
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
Stephen, A., Cyril, G., Haim, K., Theis, R.: Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory of Computing Systems 37(3), 441–456 (2004)
Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 407–422. Springer, Heidelberg (2009)
Park, J., Masuzawa, T., Hagihara, K., Tokura, N.: Distributed Algorithms for Reconstructing MST after Topology Change. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 122–132. Springer, Heidelberg (1991)
Park, J., Masuzawa, T., Hagihara, K., Tokura, N.: Efficient distributed algorithm to solve updating minimum spanning tree problem. Systems and Computers in Japan 23(3), 1–12 (1992)
Bein, D., Datta, A.K., Villain, V.: Self-Stablizing Pivot Interval Routing in General Networks. In: ISPAN, pp. 282–287 (2005)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM Commun. 17(11), 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Tel, G.: Introduction to distributed algorithm, 2nd edn. Cambridge University Press, Cambridge (2000)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal Computing 13(2), 338–355 (1984)
Higham, L., Liang, Z.: Self-stabilizing minimum spanning tree construction on message-passing networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 194–208. Springer, Heidelberg (2001)
Katz, S., Perry, K.J.: Self-stabilizing extensions for message-passing systems. Distributed Computing 7, 17–26 (1993)
Gupta, S.K.S., Srimani, P.K.: Self-stabilizing multicast protocols for ad hoc networks. J. Parallel Distrib. Comput. 63(1), 87–96 (2003)
Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7, 48–50 (1956)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech. J, 1389–1401 (1957)
Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S.: Fast Self-Stabilizing Minimum Spanning Tree Construction. Research Report, hal-00492398, HAL (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S. (2010). Fast Self-stabilizing Minimum Spanning Tree Construction. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-15763-9_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15762-2
Online ISBN: 978-3-642-15763-9
eBook Packages: Computer ScienceComputer Science (R0)