Fast network re-optimization schemes for MPLS and optical networks

DOI10.1016/J.COMNET.2005.03.004MaRDI QIDQ2581577zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Approximation algorithmsLinear programmingMPLSNetwork optimization

Mathematics Subject Classification ID

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

Recommendations

• Fast network re-optimization schemes for MPLS and optical networks
• 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.

Cited in

(8)

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

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)