Fast network re-optimization schemes for MPLS and optical networks

DOI10.1016/J.COMNET.2005.03.004zbMATH Open1081.68510OpenAlexW2010483938MaRDI QIDQ2581577FDOQ2581577

Authors: Randeep Bhatia, Murali Kodialam, T. V. Lakshman 

Publication date: 10 January 2006

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2005.03.004

Recommendations

• scientific article; zbMATH DE number 2043498
• Prompt partial path optimization in MPLS networks
• An efficient algorithm for global path optimization in MPLS networks
• Rerouting tunnels for MPLS network resource optimization
• On the solution of reroute sequence planning problem in MPLS networks.

zbMATH Keywords

MPLSApproximation algorithmsLinear programmingNetwork optimization

Mathematics Subject Classification ID

Linear programming (90C05) Network design and communication in computer systems (68M10)

Cited In (8)

• An efficient algorithm for global path optimization in MPLS networks
• Title not available (Why is that?)
• Rerouting tunnels for MPLS network resource optimization
• Fast setup of end-to-end paths for bandwidth constrained applications in an IP/MPLS--ATM integrated environment
• Prompt partial path optimization in MPLS networks
• A theory and algorithms for combinatorial reoptimization
• Distributed Computing – IWDC 2005
• A pseudo-stochastic approach for optimal decision making under limited information: a case of an aggregate production system

This page was built for publication: Fast network re-optimization schemes for MPLS and optical networks

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