DORA: Efficient Routing for MPLS Traffic Engineering

Authors:
R. Boutaba;W. Szeto;Y. Iraqi
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1/ rboutaba@bbcr.uwaterloo.ca;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
Journal of Network and Systems Management
Year:
2002

Citing 9
Cited 11

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
MPLS and Label Switching Networks

MPLS and Label Switching Networks
Data Structures and Their Algorithms

Data Structures and Their Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Profile-Based Routing: A New Framework for MPLS Traffic Engineering

COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Design and Implementation of MPLS Network Simulator Supporting LDP and CR-LDP

ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications
Traffic engineering with MPLS in the Internet

IEEE Network: The Magazine of Global Internetworking
RATES: a server for MPLS traffic engineering

IEEE Network: The Magazine of Global Internetworking

Inter-Area Traffic Engineering in a Differentiated Services Network

Journal of Network and Systems Management
Virtual Traffic Path Optimization in Connection-Oriented Networks with Stochastic Traffic

Journal of Network and Systems Management
Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach

IEEE Transactions on Computers
Performance Analysis of Adaptive Admission Control Algorithms for Bandwidth Brokers

Journal of Network and Systems Management
Design and implementation of a scalable constraint-based routing module for QoS path computation

Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
RLTE: Reinforcement Learning for Traffic-Engineering

AIMS '08 Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services
A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks

Journal of Network and Systems Management
MPLS Online Routing Optimization Using Prediction

Network Control and Optimization
Autonomic traffic engineering for network robustness

IEEE Journal on Selected Areas in Communications
Constrained minimum lightpath affinity routing in multi-layer optical transport networks

Journal of High Speed Networks
QoS protection optimisation for MPLS

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

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 allow 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.