QofIS 2000: Quality of Future Internet Services pp 129-140 | Cite as
Choosing the Objectives for Traffic Engineering in IP Backbone Networks Based on Quality-of-Service Requirements
Abstract
Objectives for traffic engineering in IP core networks can be different for different Quality-of-Service classes. In this paper we study the traffic engineering objectives for best-effort flows and for virtual leased line service flows. We propose mixed integer linear program- ming models that can be used for off-line centralized traffic engineering with label switched paths, and develop efficient algorithms for their ap- proximate solution. We quantify the effect of the choice of the objective chosen for traffic engineering on the network performance, and assess the benefits of distributing the traffic between a single border node pair over multiple paths.
Keywords
traffic engineering explicit routing Quality-of-Service diffserv.Preview
Unable to display preview. Download preview PDF.
References
- 1.D. O. Awduche, A. Chiu, A. Elwalid, I. Widjaja and X. Xiao, “A Framework for Internet Traffic Engineering”, draft-ietf-te-framework-00.txt, work in progress, January 2000.Google Scholar
- 2.E. Rosen, A. Viswanathan, and R. Callon, “A Proposed Architecture for MPLS”, draft-ietf-mpls-arch-06.txt, August 1999 (approved by IESG for RFC status Sep-tember 1999).Google Scholar
- 3.D. O. Awduche, J. Malcolm, J. Agogbua, M. O. Dell and J. McManus, “Requirements for Traffic Engineering over MPLS”, draft-ietf-mpls-traffic-eng-01.txt, work in progress, June 1999.Google Scholar
- 4.B. Fortz and M. Thorup, “Internet traffic Engineering by Optimizing OSPF Weights,” to appear in Proc. 19th IEEE Conf. On Computer Communications (INFOCOM), 2000.Google Scholar
- 5.A. Bley, M. Grotschel and R. Wessaly, “Design of Broadband Virtual Private Networks: Model and Heuristics for the B-WiN”Preprint 98–13, rad-Zuse-Zentrum fur Informationstechnik Berlin March 1998.Google Scholar
- 6.R. K. Ahuja, T. L. Magnanti and J. B. Orlin, “Network Flows: Theory, Algorithms and Applications,” Prentice-Hall, Englewood Cliffs, New Jersey, 1993.Google Scholar
- 7.G. Nemhauser and L. Wolsey, “Integer and Combinatorial Optimization”, Wiley Interscience, New York, 1988.MATHGoogle Scholar
- 8.E. I. Chong, S. Maddila and S. Morley, “On Finding Single-Source Single-Destination k Shortest paths,” in Proc. of 7th Int. Conf. On Computing and Information (ICCI), 1995, pp. 40–47.Google Scholar
- 10.E. W. Zegura, K. L. Calvert and S. Bhattacharjee, “How to Model an Internetwork,” in Proc. 15th IEEE Conf. On Computer Communications (INFOCOM), 1996, pp. 594–602.Google Scholar