Abstract
The conventional forwarding rule used by IP networks is to always choose the path with the shortest length – in terms of administrative link weights assigned to the links – to forward traffic. Lately, it has been proposed to use shortest-path-first routing to implement Traffic Engineering in IP networks, promising with a big boost in the profitability of the legacy network infrastructure. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. Unfortunately, traditional methods to calculate the link weights usually produce a bunch of superfluous shortest paths, often leading to congestion along the unconsidered paths. In this paper, we introduce and develop novel methods to increase the accuracy of this process and, by means of extensive simulations, we show that our proposed solution produces remarkably high quality link weights.
This work has been done as a part of the European sixth framework research project IP NOBEL (www.ist-nobel.org).
Chapter PDF
Similar content being viewed by others
References
Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine 40, 118–124 (2002)
Sridharan, A., Diot, C., Guérin, R.: Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. In: Proceedings of INFOCOM 2003, vol. 2, pp. 1167–1177 (March 2003)
Rétvári, G., Cinkler, T.: Practical OSPF traffic engineering. IEEE Commununications Letters 8, 689–691 (2004)
Moy, J.: OSPF Version 2. RFC 2328 (April 1998)
Wang, Y., Wang, Z., Zhang, L.: Internet traffic engineering without full-mesh overlaying. In: Proceedings of INFOCOM 2001, vol. 1, pp. 565–571 (April 2001)
Rétvári, G., Szabó, R., Bíró, J.J.: On the representability of arbitrary path sets as shortest paths: Theory, algorithms, and complexity. In: Lecture Notes in Computer Science: Proceedings of the Third International IFIP-TC6 Networking Conference, Athens, Greece, pp. 1180–1191 (May 2004)
Guerin, R., Orda, A., Williams, D.: QoS routing mechanisms and OSPF extensions. In: IETF RFC, vol. 2676 (1999)
Rétvári, G., Cinkler, T., Bíró, J.J.: Notes on shortest path representation. Tech. Rep. 2005-001 (February 2005), available online, http://qosip.tmit.bme.hu/~retvari/publications/SPR_tech_rep.pdf
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Kennington, J.L.: A survey of linear cost multicommodity network flows. Operations Research 26(2), 209–236 (1978)
Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. John Wiley & Sons, Chichester (1990)
The GLPK project, http://www.gnu.org/software/glpk/glpk.html
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Universal topology generation from a user’s perspective. Tech. Rep. 2001-003 (January 2001)
Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal of Selected Areas in Communications 14(7), 1228–1234 (1996)
Sobrinho, J.L.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. In: INFOCOM, pp. 727–735 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Rétvári, G., Bíró, J.J., Cinkler, T. (2006). On Improving the Accuracy of OSPF Traffic Engineering. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds) NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2006. Lecture Notes in Computer Science, vol 3976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753810_5
Download citation
DOI: https://doi.org/10.1007/11753810_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34192-5
Online ISBN: 978-3-540-34193-2
eBook Packages: Computer ScienceComputer Science (R0)