Prompt partial path optimization in MPLS networks

DOI10.1016/S1389-1286(03)00290-1MaRDI QIDQ1888491zbMATH OpenFDO

Authors Dániel Orincsay, Balázs Szviatovszki, Géza Böhm

Publication date 23 November 2004

Published in Computer Networks (Search for Journal in Brave)

zbMATH Keywords

MPLSOptimizationRoutingTraffic engineering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• An efficient algorithm for global path optimization in MPLS networks
• Fast network re-optimization schemes for MPLS and optical networks
• scientific article; zbMATH DE number 2043498
• On the solution of reroute sequence planning problem in MPLS networks.
• Rerouting tunnels for MPLS network resource optimization

Cited in

(11)

• Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions
• Restoration by path concatenation, fast recovery of MPLS paths
• scientific article; zbMATH DE number 2088593 (Why is no real title available?)
• An efficient algorithm for global path optimization in MPLS networks
• Restoration by path concatenation: fast recovery of MPLS paths
• A NOVEL MECHANISM BASED ON ARTIFICIAL LOGICAL SPIDER WEB FOR REROUTING IN MPLS NETWORKS
• scientific article; zbMATH DE number 2088592 (Why is no real title available?)
• On the solution of reroute sequence planning problem in MPLS networks.
• Rerouting tunnels for MPLS network resource optimization
• scientific article; zbMATH DE number 2043498 (Why is no real title available?)
• Fast network re-optimization schemes for MPLS and optical networks

This page was built for publication: Prompt partial path optimization in MPLS networks

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