Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications

Volumn 18, Issue 12, 2000, Pages 2566-2579

  Kar, Koushik ^a   Kodialam, Murali ^b   Lakshman, T V ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); INTERNET; NETWORK PROTOCOLS; OPTIMIZATION; QUALITY OF SERVICE; SIGNAL INTERFERENCE; TELECOMMUNICATION LINKS;

BANDWIDTH GUARANTEED TUNNELS; FORWARD EQUIVALENCE CLASSES; MINIMUM INTERFERENCE ROUTING; MULTIPROTOCOL LABEL SWITCHED NETWORKS; TRAFFIC ENGINEERING; VIRTUAL PRIVATE NETWORKS;

PACKET SWITCHING;

EID: 0034461274     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.898737     Document Type: Article

References (8)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewocd Cliffs, NJ: Prentice-Hall, 1993.
2. D. O. Awduche, L. Berger, D. Gan, T. Li, G Swallow, and V. Srinivasan, "Extensions to RSVP for LSP tunnels," Internet Draft draft-ietf-mpls-rsvp-lsp-tunnel-04.txt, Sept. 1999.
3. D. O. Awduche, J. Malcom, J. Agogbua, M. O'Dell, and J. McManus, "Requirements for traffic engineering over MPLS," RFC 2702, Sept. 1999.
4. R. Callon, N. Feldman, A. Fredette, G. Swallow, and A. Viswanathan, "A framework for multiprotocol label switching," Internet Draft draft-ietf-mpls-framework-03.txt, June 1999.
5. "Ancestor tree for arbitrary multi-terminal cut functions," in Proc. Conf. Integer Programming Combinatorial Optimization, 1990.
6. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM J. Computing, vol. 5, pp. 691-703, 1976.
7. H. Frank and I. T. Frisch, Communication, Transmission, and Transportation Networks. Reading, MA: Addison-Wesley, 1971.
8. A. V. Goldberg and R. E. Tarjan, "Solving minimum cost flow problem by successive approximation," in Proc. 19th ACM Symp. Theory Computing, 1987, pp. 7-18.