An Approach to Solving the Survivable Capacitated Network Design Problem

被引:0
|
作者
Sridhar, Varadharajan [1 ]
Park, June Sung [2 ]
机构
[1] Management Dev Inst, Informat Management, Gurgaon, India
[2] Samsung SDS Co Ltd, Seoul, South Korea
关键词
network capacity planning; Lagrangian relaxation; network design; network topology; optimization methods; survivability; telecommunication;
D O I
10.4018/jbdcn.2005040101
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Survivability refers to keeping a system partially or fully operational when one or more of its components fail. Survivability in telecommunication networks is crucial, as failure of a network component can potentially bring down the whole communication network, as happened in some real-world cases. Adding redundant network components increases the survivability of a network, but cost of the network also increases. In this paper, we consider the design of survivable telecommunications network architecture that uses high-capacity transport facilities. The model considers selection of capacitated links and routing of multicommodity traffic flow in the network that minimizes overall network cost. Two node disjoint paths are selected for each commodity. In case of failure of the primary path, a portion of the traffic for each commodity will be rerouted through the secondary path. The methodology presented in this paper can be used by the network designer to construct cost-effective survivable networks.
引用
收藏
页码:1 / 16
页数:16
相关论文
共 50 条
  • [1] Survivable network design: the capacitated minimum spanning network problem
    Jothi, R
    Raghavachari, B
    [J]. INFORMATION PROCESSING LETTERS, 2004, 91 (04) : 183 - 190
  • [2] Survivable capacitated network design problem:: new formulation and Lagrangean relaxation
    Ríos, M
    Marianov, V
    Gutierrez, M
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2000, 51 (05) : 574 - 582
  • [3] Solving the capacitated local access network design problem
    Salman, F. Sibel
    Ravi, R.
    Hooker, John N.
    [J]. INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 243 - 254
  • [4] Solving the survivable network design problem with search space smoothing
    Park, JC
    Han, CG
    [J]. NETWORK OPTIMIZATION, 1997, 450 : 397 - 406
  • [5] Strong inequalities for capacitated survivable network design problems
    Daniel Bienstock
    Gabriella Muratore
    [J]. Mathematical Programming, 2000, 89 : 127 - 147
  • [6] Strong inequalities for capacitated survivable network design problems
    Bienstock, D
    Muratore, G
    [J]. MATHEMATICAL PROGRAMMING, 2000, 89 (01) : 127 - 147
  • [7] A multi-objective approach for solving the survivable network design problem with simultaneous unicast and anycast flows
    Huynh Thi Thanh Binh
    Bui Thu Lam
    Nguyen Sy Thai Ha
    Ishibuchi, Hisao
    [J]. APPLIED SOFT COMPUTING, 2014, 24 : 1145 - 1154
  • [8] A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem
    Borne, S.
    Gourdin, E.
    Klopfenstein, O.
    Mahjoub, A. R.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 124 : 582 - 603
  • [9] Heuristics for the survivable network design problem
    Han, CG
    Lee, TJ
    [J]. IC'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTERNET COMPUTING, 2000, : 173 - 177
  • [10] Hierarchical approach for survivable network design
    Balakrishnan, Anantaram
    Banciu, Mihai
    Glowacka, Karolina
    Mirchandani, Prakash
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 225 (02) : 223 - 235