Design of communication networks with survivability constraints

被引:14
作者
Myung, YS [1 ]
Kim, HJ
Tcha, DW
机构
[1] Dankook Univ, Dept Business Adm, Cheonan 330714, Chungnam, South Korea
[2] Univ Ulsan, Dept Management Informat Syst, Ulsan 680749, South Korea
[3] Korea Adv Inst Sci & Technol, Grad Sch Management, Seoul, South Korea
关键词
survivable network design; integer programming; heuristics;
D O I
10.1287/mnsc.45.2.238
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The rapid growth of telecommunication capacity, driven in part by the wide-ranging deployment of fiber-optic technology has led to increasing concern regarding the survivability of such networks. Ln communication networks, survivability is usually defined as the percentage of total traffic surviving some network failures in the worst case. Most of the survivable network design models proposed to date indirectly ensure network survivability by invoking a connectivity constraint, which calls for a prespecified number of paths between every distinct pair of nodes in the network. In this paper, we introduce a new network design model which directly addresses survivability in terms of a survivability constraint which specifies the allowable level of lost traffic during a network failure under prescribed conditions. The new model enables a network designer to consider a richer set of alternative network topologies than the existing connectivity models, and encompasses the connectivity models as special cases. The paper presents a procedure to compute link survivability, develops an integer programming formulation of the proposed survivability model, and discusses a special case of practical interest and its associated heuristic procedure. The proposed heuristic is tested on data from real-world problems as well as randomly generated problems.
引用
收藏
页码:238 / 252
页数:15
相关论文
共 22 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]   CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J].
BALL, MO ;
PROVAN, JS .
NETWORKS, 1983, 13 (02) :253-278
[3]  
Bixby R. E., 1975, Networks, V5, P253
[4]   COMPUTER-AIDED-DESIGN PROCEDURES FOR SURVIVABLE FIBER OPTIC NETWORKS [J].
CARDWELL, RH ;
MONMA, CL ;
WU, TH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (08) :1188-1197
[5]   SONET TOOLKIT - A DECISION-SUPPORT SYSTEM FOR DESIGNING ROBUST AND COST-EFFECTIVE FIBEROPTIC NETWORKS [J].
COSARES, S ;
DEUTSCH, DN ;
SANIEE, I ;
WASEM, OJ .
INTERFACES, 1995, 25 (01) :20-40
[6]   THE COMPLEXITY OF MULTITERMINAL CUTS [J].
DAHLHAUS, E ;
JOHNSON, DS ;
PAPADIMITRIOOU, CH ;
SEYMOUR, PD ;
YANNAKAKIS, M .
SIAM JOURNAL ON COMPUTING, 1994, 23 (04) :864-894
[7]   SURVIVABLE NETWORKS, LINEAR-PROGRAMMING RELAXATIONS AND THE PARSIMONIOUS PROPERTY [J].
GOEMANS, MX ;
BERTSIMAS, DJ .
MATHEMATICAL PROGRAMMING, 1993, 60 (02) :145-166
[8]   FACETS FOR POLYHEDRA ARISING IN THE DESIGN OF COMMUNICATION NETWORKS WITH LOW-CONNECTIVITY CONSTRAINTS [J].
Groetschel, Martin ;
Monma, Clyde L. ;
Stoer, Mechthild .
SIAM JOURNAL ON OPTIMIZATION, 1992, 2 (03) :474-504
[9]  
GROTSCHEL M, 1990, SIAM J DISCRETE MATH, V3, P502
[10]   COMPUTATIONAL RESULTS WITH A CUTTING PLANE ALGORITHM FOR DESIGNING COMMUNICATION-NETWORKS WITH LOW-CONNECTIVITY CONSTRAINTS [J].
GROTSCHEL, M ;
MONMA, CL ;
STOER, M .
OPERATIONS RESEARCH, 1992, 40 (02) :309-330