Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method

zbMATH Open1337.68032MaRDI QIDQ2808637FDOQ2808637

Takashi Fukumoto, Teruji Sekozawa

Publication date: 24 May 2016

zbMATH Keywords

simulationlower boundheuristic algorithmLagrangian relaxationemergenciesGMPLSoptimal path designpractical approximate solution

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

   Recommendations

• An efficient algorithm for global path optimization in MPLS networks 👍 👎
• A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks 👍 👎
• Revisiting Lagrangian relaxation for network design 👍 👎
• A general MPCC model and its solution algorithm for continuous network design problem 👍 👎
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem 👍 👎
• A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem 👍 👎
• A multiobjective optimization algorithm for QoS-aware path selection in DiffServ and MPLS networks 👍 👎

This page was built for publication: Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method

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