An approach to robust network design in telecommunications

In telecommunications network design, one of the most frequent problems is to adjust the capacity on the links of the network in order to satisfy a set of requirements. In the past, these requirements were demands based on historical data and/or demographic predictions. Nowadays, because of new technology development and customer movement due to competitiveness, the demands present considerable variability. Thus, network robustness w.r.t demand uncertainty is now regarded as a major consideration. In this work, we propose a min-max-min formulation and a methodology to cope with this uncertainty. We model the uncertainty as the convex hull of certain scenarios and show that cutting plane methods can be applied to solve the underlying problems. We will compare Kelley, Elzinga-Moore and bundle methods.

[1]  Alexey V. Demyanov,et al.  Minmaxmin problems revisited , 2002, Optim. Methods Softw..

[2]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[3]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[4]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[5]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[6]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

[7]  G. L. Nemhauser,et al.  A Modified Linear Program for Columnar Methods in Mathematical Programming , 1971, Oper. Res..

[8]  Antonio Frangioni,et al.  Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..

[9]  Jack Elzinga,et al.  A central cutting plane algorithm for the convex programming problem , 1975, Math. Program..

[10]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[11]  李幼升,et al.  Ph , 1989 .

[12]  Giuseppe Paletta,et al.  A class of network design problems with multiple demand: Model formulation and an algorithmic approach , 1986 .

[13]  Alexei A. Gaivoronski,et al.  Summary of some traffic engineering studies carried out within RACE project R1044 , 1994, Eur. Trans. Telecommun..

[14]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[15]  K. Kiwiel A Cholesky dual method for proximal piecewise linear programming , 1994 .

[16]  J. Gondzio,et al.  Capacity Planning under Uncertain Demand in Telecommunication Networks , 1999 .

[17]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[18]  Adam Ouorou,et al.  Robust Capacity Assignment in Telecommunications , 2006, Comput. Manag. Sci..

[19]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[20]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[21]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[22]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[23]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..