Robust Capacity Assignment Solutions for Telecommunications Networks with Uncertain Demands

被引:17
作者
Babonneau, F. [1 ]
Vial, J. -P. [1 ]
Klopfenstein, O. [2 ]
Ouorou, A. [2 ]
机构
[1] Swiss Fed Inst Technol Lausanne EPFL, Econ & Environm Management Lab, Lausanne, Switzerland
[2] Orange Labs Res, F-92794 Issy Les Moulineaux, France
关键词
capacity assignment problem; telecommunications networks; robust optimization; DESIGN;
D O I
10.1002/net.21515
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service (QoS), the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given QoS with the cost of investment. Our model assumes that the traffic for each individual demand fluctuates in an interval around a nominal value. We use a refined version of affine decision rules based on a concept of demand proximity to model the routings as affine functions of the demand realizations. We then give a probabilistic analysis assuming the random variables follow a triangular distribution. Finally, we perform numerical experiments on network instances from Survivable fixed telecommunication Network Design Library (SNDlib) and measure the quality of the solutions by simulation. Copyright (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(4), 255-272 2013
引用
收藏
页码:255 / 272
页数:18
相关论文
共 21 条
[1]   Two-stage robust network row and design under demand uncertahty [J].
Atamtuerk, Alper ;
Zhang, Muhong .
OPERATIONS RESEARCH, 2007, 55 (04) :662-673
[2]   Metric inequalities and the Network Loading Problem [J].
Avella, Pasquale ;
Mattia, Sara ;
Sassano, Antonio .
DISCRETE OPTIMIZATION, 2007, 4 (01) :103-114
[3]  
Babonneau F, 2010, INT SER OPER RES MAN, V138, P79, DOI 10.1007/978-1-4419-1129-2_3
[4]   A partitioning algorithm for the network loading problem [J].
Babonneau, F. ;
Vial, J. -P. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (01) :173-179
[5]   Routing of uncertain traffic demands [J].
Ben-Ameur, W ;
Kerivin, H .
OPTIMIZATION AND ENGINEERING, 2005, 6 (03) :283-313
[6]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[7]   Adjustable robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Goryashko, A ;
Guslitzer, E ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2004, 99 (02) :351-376
[8]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[9]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[10]   Robust network design in telecommunications under polytope demand uncertainty [J].
Lemarechal, Claude ;
Ouorou, Adam ;
Petrou, Georgios .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) :634-641