DORA: Efficient Routing for MPLS Traffic Engineering

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.

[1]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.

[2]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[3]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[4]  T. V. Lakshman,et al.  RATES: a server for MPLS traffic engineering , 2000, IEEE Netw..

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[6]  Gaeil An,et al.  Design and implementation of MPLS network simulator supporting LDP and CR-LDP , 2000, Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium.

[7]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[8]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Uyless D. Black.  MPLS and Label Switching Networks , 2000 .

[10]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[13]  Yugeng Sun,et al.  A static routing algorithm used in the Internet traffic engineering , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).

[14]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[15]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[16]  Harry R. Lewis,et al.  Data Structures and Their Algorithms , 1991 .