DORA: Efficient Routing for MPLS Traffic Engineering

Journal of Network and Systems Management

Volumn 10, Issue 3, 2002, Pages 309-325

  Boutaba, Raouf ^a   Szeto, Wayne ^a   Iraqi, Youssef ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Constraint based routing; MPLS; Traffic engineering

Indexed keywords

BANDWIDTH; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); INTERNET; PROBLEM SOLVING; QUALITY OF SERVICE; SWITCHING;

CONSTRAINT-BASED ROUTING; MPLS; MULTI-PROTOCOL LABEL SWITCHING (MPLS); TRAFFIC ENGINEERING (TE);

NETWORK PROTOCOLS;

EID: 1942453432     PISSN: 10647570     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019810526535     Document Type: Article

References (18)

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.
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.
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.
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.
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.
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.
16. U. Black, MPLS and Label Switching Networks, Prentice Hall, New Jersey, 2001.
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.