Robust path design algorithms for traffic engineering with restoration in MPLS networks

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2002, Pages 933-938

  Yetginer, Emre ^a   Karasan, Ezhan ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER LINEAR PROGRAMMING; LINK-DISJOINT PATHS; MULTIPROTOCOL LABEL SWITCHING NETWORKS; OFF-LINE COMPUTATION; RESIDUAL CAPACITY; RESTORATION PATHS; TRAFFIC ENGINEERING; TRAFFIC UNCERTAINTIES;

HIGHWAY ENGINEERING; INTEGER PROGRAMMING;

RESTORATION;

EID: 84883851624     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2002.1021784     Document Type: Conference Paper

References (7)

1. E. Rosen, A. Viswanathan, and R. Callon, "Multiprotocol Label Switching Architecture", Internet Draft draftietf-mpls-arch-07. txt, July 2000.
2. B. Davie, Y. Rekhter, MPLS Technology and Applications, Morgan Kaufmann, 2000.
3. G. Swallow, "MPLS Advantages for Traffic Engineering", IEEE Comm. Mag., Dec 1999, pp. 54-57.
4. Thomas M. Chan, "Reliable Services in MPLS", IEEE Comm. Mag., Dec 1999, pp. 58-62.
5. L. Mo, "General Considerations for Bandwidth Reservation in Protection", Internet Draft draft-mo-mplsprotection-00. txt, July 2000.
6. M. Kodialam and T. V. Lakshman, "Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration", IEEE Infocom 2000.
7. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows. Englewood Cliffs, NJ: Prentice Hall, 1993.