Path computation for traffic engineering in MPLS networks

DOI10.1007/3-540-47734-9_30MaRDI QIDQ2777259zbMATH OpenFDO

Authors Gargi Banerjee, Deepinder P. Sidhu

Publication date 7 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2094/20940302

zbMATH Keywords

K-shortest pathMPLSpath computationtraffic engineering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Dynamic online routing algorithm for traffic engineering in MPLS networks
• A hybrid multicommodity routing algorithm for traffic engineering
• scientific article; zbMATH DE number 2088592
• scientific article; zbMATH DE number 2088139
• An efficient algorithm for global path optimization in MPLS networks

Cited in

(17)

• A novel path protection scheme for MPLS networks using multi-path routing
• An efficient algorithm for global path optimization in MPLS networks
• Traffic engineering for MPLS-based virtual private networks
• Fault tolerance and load balancing in QoS provisioning with multiple MPLS paths
• scientific article; zbMATH DE number 2088457 (Why is no real title available?)
• scientific article; zbMATH DE number 2088592 (Why is no real title available?)
• Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol
• Dynamic online routing algorithm for traffic engineering in MPLS networks
• Performance analysis of flow loss probability and link utilization in MPLS networks for traffic engineering
• Profile-based routing: A new framework for MPLS traffic engineering
• Network dimensioning with MPLS
• A new path selection algorithm for MPLS networks based on available bandwidth estimation
• A hybrid multicommodity routing algorithm for traffic engineering
• scientific article; zbMATH DE number 2088139 (Why is no real title available?)
• Preprocessing for segment routing optimization
• TRIDENT: an automated approach to traffic engineering in IP/MPLS over ASON/GMPLS networks
• Loop-free traffic engineering with path protection in MPLS VPNs

This page was built for publication: Path computation for traffic engineering in MPLS networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777259)