Abstract
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree.
In this paper we consider for the first time the problem of computing all the replacement minimum-cost spanning trees distributively, and we efficiently solve the problem. We design a solution protocol and we prove that the total amount of data items communicated during the computation is O(n 2). This communication can be achieved either transmitting O(n) long messages, if the system so allows, or O(n 2) standard messages. Even in systems that do not allow long messages, the proposed protocol constitutes a significant improvement over the individual computation of the replacement trees.
Research partially supported by NSERC Canada.
Chapter PDF
Similar content being viewed by others
References
Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestor: A survey and a new distributed algorithm for a distributed environment. Theory of Computing System 37, 441–456 (2004)
Cheng, C., Cimet, I.A., Kumar, S.P.R.: A protocol to maintain a minimum spanning tree in a dynamic topology. Comput. Commun. Rev. 18(4), 330–338 (1988)
Chin, F., Houck, D.: Algorithms for updating minimal spanning trees. J. Comput. System Sci. 16(3), 333–344 (1978)
Das, B., Loui, M.C.: Reconstructing a minimum spanning tree after deletion of any node. Algorithmica 31, 530–547 (2001)
Dixon, B., Rauch, M., Tarjan, R.E.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Computing 21(6), 1184–1192 (1992)
Dixon, B., Tarjan, R.E.: Optimal parallel verification of minimum spanning trees in logarithmic time. Algorithmica 17(1), 11–17 (1997)
Faloutsos, M., Molle, M.: A linear-time optimal-message distributed algorithm for minimum spanning trees. Distributed Computing 17(2), 151–170 (2004)
Flocchini, P., Mesa Enriques, A., Pagli, L., Prencipe, G., Santoro, N.: Point of failure shortest-path rerouting. IEICE Trans. Inf. Syst. E89-D (2), 700–708 (2006)
Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Widmayer, P., Zuva, T.: Computing all the best swap edges distributively. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 154–168. Springer, Heidelberg (2004)
Gaibisso, C., Proietti, G., Tan, R.B.: Optimal MST maintenance for transient deletion of every node in planar graphs. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 404–414. Springer, Heidelberg (2003)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum spanning tree. ACM Trans. Prog. Lang. and Systems 5(1), 66–77 (1983)
Johnson, D.B., Metaxas, P.: A parallel algorithm for computing minimum spanning trees. J. Algorithms 19, 383–401 (1995)
Nardelli, E., Proietti, G., Widmayer, P.: Nearly linear time minimum spanning tree maintenance for transient node failures. Algoritmica 40, 119–132 (2004)
Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Chichester (2007)
Tsin, Y.H.: On handling vertex deletion in updating minimum spanning trees. Information Processing Letters 27(4), 167–168 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flocchini, P., Enriquez, T.M., Pagli, L., Prencipe, G., Santoro, N. (2007). Distributed Computation of All Node Replacements of a Minimum Spanning Tree. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)