Capacity and flow assignment of data networks by generalized Benders decomposition

Authors:
Philippe Mahey;Abdelhamid Benchakroun;Florence Boyer
Affiliations:
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes, CNRS, Campus des Cézeaux, 63173 Aubière, France (e-mail: philippe.mahey@isima.fr);Département de Mathématiques et d'Informatique, Université de Sherbrooke, Quebec, Canada;France Telecom R&D, Sophia-Antipolis, France
Venue:
Journal of Global Optimization
Year:
2001

Citing 7
Cited 4

Data networks

Data networks
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
Network Design Using Cut Inequalities

SIAM Journal on Optimization
The design of store-and-forward (s/f) networks for computer communications

The design of store-and-forward (s/f) networks for computer communications
A Survey of Algorithms for Convex Multicommodity Flow Problems

Management Science
Communication nets; stochastic message flow and delay

Communication nets; stochastic message flow and delay
Bounds for global optimization of capacity expansion and flow assignment problems

Operations Research Letters

A tabu search algorithm for the routing and capacity assignment problem in computer networks

Computers and Operations Research
A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research
Multiple allocation hub-and-spoke network design under hub congestion

Computers and Operations Research
A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mixed-integer non-linear model is proposed to optimize jointly the assignment of capacities and flows (the CFA problem) in a communication network. Discrete capacities are considered and the cost function combines the installation cost with a measure of the Quality of Service (QoS) of the resulting network for a given traffic. Generalized Benders decomposition induces convex subproblems which are multicommodity flow problems on different topologies with fixed capacities. These are solved by an efficient proximal decomposition method. Numerical tests on small to medium-size networks show the ability of the decomposition approach to obtain global optimal solutions of the CFA problem.