Abstract
Given a weighted graph G (V G , E G ) representing a communication network, with n nodes and m edges where the weights are positive integers, its Spanning Tree is typically used to route messages. In [1] the routing cost of a spanning tree is defined as the sum of the distances over all pairs of vertices of this tree. Hence, the most suitable spanning tree for the routing problem is the one minimizing the routing cost: the Minimum Routing Cost Spanning Tree (MRCST).
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
Liebchen, C., Wunsch, G.: The zoo of the tree spanner problems. Discrete Applied Mathematics 156, 569–587 (2008)
Flocchini, P., Mesa Enriques, A., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: computing the optimal swap edges distributively. IEICE Transactions on Information and Systems 2(E89-D), 700–708 (2006)
Johnson, D.S., Lenstra, J.K., Kan, A.R.: The complexity of the network design problem. Networks 8, 279–285 (1978)
Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest-paths tree is good and fast. Algoritmica 35, 56–74 (2003)
Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Chichester (2007)
Wu, B.Y., Hsiao, C.Y., Chao, K.M.: The swap edges of a multiple-sources routing tree. Algorithmica 50(3), 299–311 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pagli, L., Prencipe, G. (2009). Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds) Principles of Distributed Systems. OPODIS 2009. Lecture Notes in Computer Science, vol 5923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10877-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-10877-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10876-1
Online ISBN: 978-3-642-10877-8
eBook Packages: Computer ScienceComputer Science (R0)