Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

被引:156
作者
Iraschko, RR [1 ]
MacGregor, MH
Grover, WD
机构
[1] Opt Networks Inc, Palo Alto, CA 94304 USA
[2] Telus PLAnet, Edmonton, AB T5J ON5, Canada
[3] Univ Alberta, Dept Comp Sci, Edmonton, AB, Canada
[4] Univ Alberta, Dept Elect Engn, Edmonton, AB, Canada
[5] TRLabs, Edmonton, AB T5K 2P7, Canada
关键词
capacity placement; mesh restoration; survivable networks;
D O I
10.1109/90.700896
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The total transmission rapacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration [11], [12], Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint, We pro vide a method for capacity optimization of path-restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration, Lower bounds on spare capacity requirements in span-and path-restorable networks are first compared, followed by an integer program formulation based an how constraints which solves the spare and/or working capacity placement problem in either spanor path-restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.
引用
收藏
页码:325 / 336
页数:12
相关论文
共 28 条
[1]  
BAREZZANI M, 1992, P IEEE ICC 92
[2]  
CHAO CW, 1991, P IEEE GLOBECOM 91
[3]  
Chujo T., 1991, Electronics and Communications in Japan, Part 1 (Communications), V74, P1, DOI 10.1002/ecja.4410740701
[4]   USING DISTRIBUTED TOPOLOGY UPDATE AND PREPLANNED CONFIGURATIONS TO ACHIEVE TRUNK NETWORK SURVIVABILITY [J].
COAN, BA ;
LELAND, WE ;
VECCHI, MP ;
WEINRIB, A ;
WU, LT .
IEEE TRANSACTIONS ON RELIABILITY, 1991, 40 (04) :404-416
[5]  
Doverspike R., 1994, Journal of Network and Systems Management, V2, P95, DOI 10.1007/BF02139308
[6]   COMPARISON OF K-SHORTEST PATHS AND MAXIMUM FLOW ROUTING FOR NETWORK FACILITY RESTORATION [J].
DUNN, DA ;
GROVER, WD ;
MACGREGOR, MH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1994, 12 (01) :88-99
[7]  
Grover W.D., 1989, THESIS U ALBERTA EDM
[8]  
GROVER WD, 1994, TELECOMMUNICATIONS N, P337
[9]  
GROVER WD, 1987, P IEEE GLOBECOM 87
[10]  
HERZBERG M, 1996, NETWORKS 96, P665