By Topic

MPLS traffic engineering using enhanced minimum interference routing: an approach based on lexicographic max-flow

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
K. Kar ; Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA ; M. Kodialam ; T. V. Lakshman

The main contribution of this paper is a new algorithm for dynamic routing of bandwidth guaranteed tunnels. The algorithm is a generalization of the “minimum-interference” based algorithm presented in Kodialam and Lakshman (2000). The routing objective is to satisfy as many potential future requests as possible in an environment where requests arrive one-by-one, and there is no knowledge of future arrivals other than their potential ingress-egress points. An application of these algorithms is for the routing of MPLS bandwidth-guaranteed label-switched paths (LSP). The presented algorithm performs better than the previous scheme, and other previously proposed algorithms, on several metrics like the number of rejected demands and successful re-routing of demands upon link failure. Also, the new algorithm is more robust in performance to implementations where most requests are routed with a shortest-path computation, and the computations required for determining “minimum-interference” are performed only infrequently

Published in:

Quality of Service, 2000. IWQOS. 2000 Eighth International Workshop on

Date of Conference: