Dynamic bandwidth-allocation and path-restoration in SONET self-healing networks

被引:8
作者
Gersht, A
Kheradpir, S
Shulman, A
机构
[1] GTE Laboratories Inc, Waltham, MA 02254
关键词
network survivability; SONET DCS; self-healing network; dynamic bandwidth allocation & restoration;
D O I
10.1109/24.510821
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a new scheme for real-time bandwidth allocation and path restoration (BARS) in mesh networks via SONET WDCSs in response to demand & load dynamics and link and/or node failure(s), The scheme dynamically maximizes bandwidth allocation while ensuring full service restorability. Since the physical network capacity is limited, sometime not all the demand can be accommodated under the full restorability requirement, This demand in SONET BARS is rejected fairly at the network boundary even if capacity for allocation is available, Bandwidth allocation and fair demand admission are optimized jointly under the full restorability requirements, The implementation of SONET WDCS does not need excessive storage. An efficient parallel algorithm for solving the optimization problem is also presented, The algorithm produces superior spare capacity assignments compared to the results in the literature.
引用
收藏
页码:321 / 331
页数:11
相关论文
共 16 条
[1]  
*AT T BELL LABS, 1986, ENG OP BELL SYST
[2]  
DAVIDSON R, 1991, GUIDE SONET PLANNING
[3]  
ELLEFSON F, 1990, P IEEE GLOBECOM 90, P65
[4]  
GARCIA C., 1981, PATHWAYS SOLUTIONS F
[5]   OPTIMAL ROUTING IN CIRCUIT SWITCHED COMMUNICATION-NETWORKS [J].
GERSHT, A ;
SHULMAN, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (11) :1203-1211
[6]   REAL-TIME TRAFFIC MANAGEMENT BY A PARALLEL ALGORITHM [J].
GERSHT, A ;
KHERADPIR, S ;
FRIEDMAN, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (02) :351-361
[7]  
GERSHT A, 1988, P IEEE INFOCOM 88, P585
[8]  
GERSHT A, 1993, IEEE ICC 93
[9]  
GERSHT A, 1990, P IEEE GLOBECOM 90, P408
[10]  
GERSHT A, 1991, P 13 ITC C, P67