Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

J. E. Burns; Teunis J. Ott; Johan M. de Kock; Anthony E. Krzesinski

doi:10.1117/12.434314

24 July 2001 Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

J. E. Burns, Teunis J. Ott, Johan M. de Kock, Anthony E. Krzesinski

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

Abstract

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.

Citation Download Citation

J. E. Burns, Teunis J. Ott, Johan M. de Kock, and 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); https://doi.org/10.1117/12.434314

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available