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
相关论文
共 30 条
  • [1] AN ALGORITHM FOR DESIGNING SURVIVABLE NETWORKS
    AGARWAL, YK
    [J]. AT&T TECHNICAL JOURNAL, 1989, 68 (03): : 64 - 76
  • [2] Primary and secondary route selection in backbone communication networks
    Amiri, A
    Pirkul, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (01) : 98 - 109
  • [3] Designing hierarchical survivable networks
    Balakrishnan, A
    Magnanti, TL
    Mirchandani, P
    [J]. OPERATIONS RESEARCH, 1998, 46 (01) : 116 - 136
  • [4] Boffey T. B., 1982, GRAPH THEORY OPERATI
  • [5] SONET TOOLKIT - A DECISION-SUPPORT SYSTEM FOR DESIGNING ROBUST AND COST-EFFECTIVE FIBEROPTIC NETWORKS
    COSARES, S
    DEUTSCH, DN
    SANIEE, I
    WASEM, OJ
    [J]. INTERFACES, 1995, 25 (01) : 20 - 40
  • [6] Fisher M., 1981, INFORMS, V27, P1
  • [7] Solving the two-connected network with bounded meshes problem
    Fortz, B
    Labbé, M
    Maffioli, F
    [J]. OPERATIONS RESEARCH, 2000, 48 (06) : 866 - 877
  • [8] FIBEROPTIC CIRCUIT NETWORK DESIGN UNDER RELIABILITY CONSTRAINTS
    GAVISH, B
    TRUDEAU, P
    DROR, M
    GENDREAU, M
    MASON, L
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (08) : 1181 - 1187
  • [9] ROUTING IN A NETWORK WITH UNRELIABLE COMPONENTS
    GAVISH, B
    NEUMAN, I
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (07) : 1248 - 1258
  • [10] SURVIVABLE NETWORKS, LINEAR-PROGRAMMING RELAXATIONS AND THE PARSIMONIOUS PROPERTY
    GOEMANS, MX
    BERTSIMAS, DJ
    [J]. MATHEMATICAL PROGRAMMING, 1993, 60 (02) : 145 - 166