Dynamic Online Routing Algorithm for MPLS Traffic Engineering
R. Boutaba
University of Waterloo, School of Computer Science, 200 University Avenue West, Waterloo, ON., N2L 3G1, CANADA
Email: rboutaba_AT_bbcr.uwaterloo.ca
W. Szeto
University of Waterloo, School of Computer Science, 200 University Avenue West, Waterloo, ON., N2L 3G1, CANADA
Email: wwszeto_AT_bbcr.uwaterloo.ca
Y. Iraqi
University of Waterloo, School of Computer Science, 200 University Avenue West, Waterloo, ON., N2L 3G1, CANADA
Email: iraqi_AT_bbcr.uwaterloo.ca
Abstract
This paper introduces DORA, a dynamic online routing algorithm for
construction of bandwidth guaranteed paths in MPLS-enabled networks. The main
objective of DORA is to place paths with reserved bandwidth evenly across the
network in order to al-low more future paths to be accepted into the network and
to balance the traffic load. During path computation, the key operation in DORA
is to avoid routing over links that (1) have high potential to be part of any other
path, and (2) have low residual bandwidth available. Our simulation results based
on unsuccessful path-setup ratio and successful path-reroutes upon link failure,
show that DORA offers better performance than some sophisticated algorithms, while
at the same time being less computationally expensive.
Keywords: MPLS; constraint-based routing; traffic engineering.
JNSM: Vol. 10, No. 3, 2002
Dynamic Online Routing Algorithm for MPLS Traffic Engineering [Vol. 10, No. 3, 2002]
NOTE: only abstract of paper available on-line; please contact your library or the authors for the full paper
Back to JNSM main page