24 July 2001 Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach
Author Affiliations +
Proceedings Volume 4523, Internet Performance and Control of Network Systems II; (2001) https://doi.org/10.1117/12.434314
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. E. Burns, J. E. Burns, Teunis J. Ott, Teunis J. Ott, Johan M. de Kock, Johan M. de Kock, Anthony E. Krzesinski, Anthony E. Krzesinski, } "Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach", Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); doi: 10.1117/12.434314; https://doi.org/10.1117/12.434314


Techniques for animating algorithm
Proceedings of SPIE (March 21 1996)
Polynomial time algorithm for hop constrained QoS routing
Proceedings of SPIE (August 07 2003)
How efficient is BitTorrent?
Proceedings of SPIE (January 15 2006)

Back to Top