Abstract
The question, whether an optional set of routes can be represented as shortest paths, and if yes, then how, has been a rather scarcely investigated problem up until now. In turn, an algorithm that, given an arbitrary set of traffic engineered paths, can efficiently compute OSPF link weights as to map the given paths to shortest paths may be of huge importance in today’s IP networks, which still rely on legacy shortest-path-first routing protocols. This article establishes the fundamental theory and algorithms of shortest path representability, and concludes that in general it is much more difficult task to compute shortest path representable paths than to actually calculate link weights for such paths.
This work was supported by the Ministry of Education, Hungary under the reference No. IKTA-0092/2002.
Chapter PDF
Similar content being viewed by others
References
D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, “Overview and principles of Internet traffic engineering.” RFC 3272, May 2002.
J. Moy, “OSPF Version 2.” RFC 2328, April 1998.
B. Fortz, J. Rexford, and M. Thorup, “Traffic engineering with traditional IP routing protocols,” IEEE Communications Magazine, vol. 40, pp. 118–124, Oct 2002.
B. Fortz and M. Thorup, “Optimizing OSPF/IS-IS weights in a changing world,” IEEE Journal of Selected Areas in Communications, vol. 20, pp. 756–767, May 2002.
B. Fortz and M. Thorup, “Increasing internet capacity using local search,” 2000. unpublished manuscript, http://www.research.att.com/~mthorup/PAPERS/or_ospf.ps.
Z. Wang, Y. Wang, and L. Zhang, “Internet traffic engineering without full-mesh overlaying,” in Proceedings of INFOCOM 2001, April 2001.
A. Sridharan, C. Diot, and R. Guérin, “Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks,” in Proceedings of INFOCOM 2003, March 2003.
M. Thorup, “Avoiding ties in shortest path first routing,” 2001. unpublished manuscript, http://www.research.att.com/~mthorup/PAPERS/ties_ospf.ps.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993.
M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows. John Wiley & Sons, January 1990.
A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: Universal topology generation from a user’s perspective,” Tech. Rep. 2001–003, 1 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rétvári, G., Szabó, R., Bíró, J.J. (2004). On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive