Comparative analysis of path computation techniques for MPLS traffic engineering

Computer Networks

Volumn 40, Issue 1, 2002, Pages 149-165

  Banerjee, Gargi ^a   Sidhu, Deepinder ^a  

^a University of Marylandw Baltimore County   (United States)

Author keywords

MPLS; Multi constrained path; Path computation; QoS; Traffic engineering

Indexed keywords

ALGORITHMS; BANDWIDTH; CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; QUALITY OF SERVICE; SWITCHING NETWORKS; TELECOMMUNICATION TRAFFIC;

MULTIPROTOCOL LABEL SWITCHING (MPLS); TRAFFIC ENGINEERING (TE);

INTERNET;

EID: 0036722890     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(02)00270-0     Document Type: Article

References (19)

1. QoS routing mechanisms and OSPF extensions
2. Requirements for traffic engineering over MPLS
3. RSVP-TE: Extensions to RSVP for LSP tunnels
4. On finding multi-constrained paths
5. Internet traffic engineering by optimizing OSPF weights
6. Beyond the flow decomposition barrier
7. Search space reduction in QoS routing
8. Algorithms for finding paths with multiple constraints
9. Constraint-based LSP setup using LDP
10. Minimum interference routing with applications to MPLS traffic engineering
11. An efficient algorithm for finding a path subject to two additive constraints
12. A*Prune: An algorithm for finding K shortest paths subject to multiple constraints
13. On path selection for traffic with bandwidth guarantees
14. A multiple quality of service routing algorithm for PNNI
15. Bandwidth-delay based routing algorithms
16. On the complexity of quality of service routing