A case study of multiservice, multipriority traffic engineering design for data networks
- 22 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1b, 1077-1083
- https://doi.org/10.1109/glocom.1999.830281
Abstract
We present techniques, some of which are novel, for traffic engineering in QoS-supported data networks, and also illustrate the application of these techniques in a case study. In the interest of scalability all these techniques use multicommodity flow (MCF) solution techniques as primitives. The techniques address the design of topology and size of explicit routes in MPLS-supported IP networks and VPNs. The techniques are for network-wide optimization subject to constraints on routing imposed by end-to-end QoS and other considerations. The notion of admissible route sets specific to service class and source-destination pair is used to differentiate QoS constraints on real-time services, such as Internet telephony and video, and relatively delay insensitive services, such as premium data. Contrasting optimization techniques are given for services, such as best effort, for which no restriction on routes are imposed. Another important traffic engineering requirement addressed is priorities, for which an efficient and accurate design technique is given.Keywords
This publication has 8 references indexed in Scilit:
- A case study of multiservice, multipriority traffic engineering design for data networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Faster and simpler algorithms for multicommodity flow and other fractional packing problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Virtual private networks: joint resource allocation and routing designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- ATM network design and optimization: a multirate loss network frameworkIEEE/ACM Transactions on Networking, 1996
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992
- Computational results of an interior point algorithm for large scale linear programmingMathematical Programming, 1991
- Data Structures and Programming Techniques for the Implementation of Karmarkar's AlgorithmINFORMS Journal on Computing, 1989
- MINOS 5.0 User's Guide.Published by Defense Technical Information Center (DTIC) ,1983