An efficient algorithm for global path optimization in MPLS networks
From MaRDI portal
Recommendations
- Prompt partial path optimization in MPLS networks
- scientific article; zbMATH DE number 1717247
- A hybrid multicommodity routing algorithm for traffic engineering
- Fast network re-optimization schemes for MPLS and optical networks
- A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks
Cited in
(12)- Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions
- Metaheuristic approaches for IP/MPLS network design
- A new algorithm for standard cell global routing
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem
- scientific article; zbMATH DE number 1981018 (Why is no real title available?)
- scientific article; zbMATH DE number 1717247 (Why is no real title available?)
- A multiobjective optimization algorithm for QoS-aware path selection in DiffServ and MPLS networks
- Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method
- A hybrid multicommodity routing algorithm for traffic engineering
- Prompt partial path optimization in MPLS networks
- 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: An efficient algorithm for global path optimization in MPLS networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863861)