Abstract
Today, the main alternative for intra-domain traffic engineering in IP networks is to use different methods for setting the weights (and so decide upon the shortest-paths) in the routing protocols OSPF and IS-IS. In this paper we study how traffic engineering perform in real networks. We analyse different weight-setting methods and compare performance with the optimal solution given by a multi-commodity flow optimization problem. Further, we investigate their robustness in terms of how well they manage to cope with estimated traffic matrix data. For the evaluation we have access to network topology and traffic data from an operational IP network.
This work was supported by Vinnova via the EvaluNet project and by the Winternet program which is funded by the Swedish Foundation for Strategic Research. The work was also supported by the European commission via the Ambient Networks project
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abrahamsson, H., Alonso, J., Ahlgren, B., Andersson, A., Kreuger, P.: A Multi Path Routing Algorithm for IP Networks Based on Flow Optimisation. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds.) QofIS 2002 and ICQT 2002. LNCS, vol. 2511, pp. 135–144. Springer, Heidelberg (2002)
Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X.: Overview and principles of Internet Traffic Engineering. Internet RFC 3272 (May 2002)
Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proceedings IEEE INFOCOM 2000, Israel, March 2000, pp. 519–528 (2000)
Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4), 756–767 (2002)
Gunnar, A., Johansson, M., Telkamp, T.: Traffic Matrix Estimation on a Large IP Backbone - a Comparison on Real Data. In: Proceedings of ACM Internet Measurement Conference, Taormina, Sicily, Italy (October 2004)
Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation: Existing techniques and new directions. In: Proc. ACM SIGCOMM, Pittsburg, USA (August 2002)
Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Commmunication and Computer Networks. Morgan Kaufmann, San Francisco (2004)
Ramakrishnan, K.G., Rodrigues, M.A.: Optimal routing in shortest path data networks. Lucent Bell Labs Technical Journal 6(1) (2001)
Roughan, M., Thorup, M., Zhang, Y.: Traffic Engineering with Estimated Traffic Matrices. In: Proceedings ACM Internet Measurement Conference, Miami Beach, Florida, USA (October 2003)
Söderqvist, M.: Search Heuristics for Load Balancing in IP-networks. Technical Report T2005:04, SICS – Swedish Institute of Computer Science (March 2005)
Sridharan, A., Guerin, R., Diot, C.: Achieving Near-Optimal Traffic Engineering Solutions for Current OSPF/IS-IS Networks. In: Proceedings of IEEE INFOCOM 2003, San Francisco, USA, mars (2003)
Wang, Y., Wang, Z., Zhang, L.: Internet traffic engineering without full mesh overlaying. In: Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska (2001)
Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proc. ACM SIGCOMM, Karlsruhe, Germany (August 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gunnar, A., Abrahamsson, H., Söderqvist, M. (2005). Performance of Traffic Engineering in Operational IP Networks – An Experimental Study. In: Magedanz, T., Madeira, E.R.M., Dini, P. (eds) Operations and Management in IP-Based Networks. IPOM 2005. Lecture Notes in Computer Science, vol 3751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11567486_21
Download citation
DOI: https://doi.org/10.1007/11567486_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29356-9
Online ISBN: 978-3-540-32096-8
eBook Packages: Computer ScienceComputer Science (R0)