Skip to main content
SpringerLink
Log in

DORA: Efficient Routing for MPLS Traffic Engineering

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. K. Kar, M. Kodialam, and T. V. Lakshman, Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications, IEEE Journal on Selected Areas in Communications: Quality of Service in the Internet, Vol. 18, No. 12, pp. 921–940, Dec. 2000.

    Google Scholar 

  2. S. Suri, M. Waldvogel, and P. R. Warkhede, Profile-based routing: A new framework for MPLS traffic engineering. In Quality of Future Internet Services, Lecture Notes in Computer Science, Springer, New York, 2001.

    Google Scholar 

  3. B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM), Tel Aviv, Israel, March 2000.

    Google Scholar 

  4. Y.Wang and Z.Wang, Explicit routing algorithms for internet traffic engineering. In Proceedings of the 8th Computer Communications and Networks, Boston, Massachusetts, Oct. 1999.

  5. Z. Liu, Y. Sun, and X. Xue, A static routing algorithm used in the Internet traffic engineering. In Proceedings of the 7th Asian-Pacific Conference on Circuits and Systems (IEEE APCCAS), Tianjin, China, Dec. 2000.

  6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  7. D. Katz, D. Yeung, and K. Kompella, Traffic engineering extensions to OSPF. Work in progress, Internet Draft, draft-katz-yeung-ospf-traffic-05.txt, 2001.

  8. T. Li and H. Smit, IS-IS extensions for traffic engineering. Work in progress, Internet Draft, draft-ietf-isis-traffic-04.txt, 2001.

  9. S. McCanne and S. Floyd, Network Simulator 2, http://www.isi.edu/nsnam/ns/.

  10. A. V. Goldberg and R. E. Tarjan, A new Approach to the maximum flow problem. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, Journal of ACM (JACM), Vol. 35, No. 4, Oct. 1988.

  11. H. R. Lewis and L. Denenberg, Data Structures and Their Algorithms, HarperCollins, New York, 1991.

    Google Scholar 

  12. E. Rosen, A. Viswanathan, and R. Callon, Multiprotocol label switching architecture, RFC3031, Jan. 2001.

  13. D. Awudche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus, Requirements for traffic engineering over MPLS, RFC 2702, Sept. 1999.

  14. X. Xiao, A. Hanna, B. Bailey, and L. M. Ni, Traffic engineering with MPLS in the Internet, IEEE Network Magazine, Vol. 14, No. 2, 2000.

  15. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, New Jersey, 1993.

    Google Scholar 

  16. U. Black, MPLS and Label Switching Networks, Prentice Hall, New Jersey, 2001.

    Google Scholar 

  17. G. Ahn and W. Chun, Design and implementation of MPLS network simulator supporting LDP and CR-LDP. In Proceedings of the 8th International Conference on Networks (IEEE ICON 2000), Singapore, 2000.

  18. P. Aukia, M. Kodialam, P. V. N. Koppol, T. V. Lakshman, H. Sarin, and B. Suter, RATES: A server for MPLS traffic engineering, IEEE Network Magazine, Vol. 14, No. 2, pp. 34–41, March-April 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    R. Boutaba, W. Szeto & Y. Iraqi

Authors
  1. R. Boutaba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Szeto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. Iraqi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Boutaba.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boutaba, R., Szeto, W. & Iraqi, Y. DORA: Efficient Routing for MPLS Traffic Engineering. Journal of Network and Systems Management 10, 309–325 (2002). https://doi.org/10.1023/A:1019810526535

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019810526535

Search

Navigation