An optimization approach for congestion control in network routing with quality of service requirements
Authors:
Abstract
In this paper we study a network design problem arising in the management of a carrier network. The aim is to route a traffic matrix, minimizing a measure of the network congestion while guaranteeing a prescribed quality of service. We formulate the problem, devise presolve procedures to reduce the size of the corresponding mixed‐integer programming formulation and show that the proposed approach can efficiently solve some real‐life problems, leading to an improvement with respect to the current practice in a real case study.Keywords
This publication has 33 references indexed in Scilit:
- The robust network loading problem with dynamic routingComputational Optimization and Applications, 2012
- Complexity of column generation in network design with path-based survivability mechanismsNetworks, 2011
- On cut-based inequalities for capacitated network design polyhedraNetworks, 2011
- An improved Benders decomposition applied to a multi-layer network design problemOperations Research Letters, 2009
- Metric inequalities and the Network Loading ProblemDiscrete Optimization, 2007
- Design of survivable IP-over-optical networksAnnals of Operations Research, 2006
- Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path ProblemNetworks, 2003
- New formulations and solution procedures for the hop constrained network design problemEuropean Journal of Operational Research, 2003
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network designDiscrete Applied Mathematics, 2001
- The constrained shortest path problemNaval Research Logistics Quarterly, 1978