PERFORMANCE ANALYSIS OF FAST DISTRIBUTED LINK RESTORATION ALGORITHMS

被引：5

作者：

CHOW, CE ^{[1
]}

BICKNELL, JD ^{[1
]}

MCCAUGHEY, S ^{[1
]}

SYED, S ^{[1
]}

机构：

[1] MCI TELECOMMUN,COLORADO SPRINGS,CO 80919

来源：

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS | 1995年 / 8卷 / 05期

关键词：

NETWORK RESTORATION; DISTRIBUTED ALGORITHMS;

D O I：

10.1002/dac.4500080505

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Four distributed link restoration algorithms are analysed in detail using a set of important performance metrics and functional characteristics. The functional characteristics are used to explain how these algorithms function and provide insight into their performance. The analysis and simulation results indicate that the two prong link restoration algorithm, which is based on issuing aggregate restoration requests from both ends of the disruption and on an intelligent backtracking mechanism, outperforms the other three algorithms in terms of restoration time. The RREACT link restoration algorithm consistently found paths that use fewer spares.

引用

页码：325 / 345

页数：21

共 33 条

[1]

AWERBUCH B, 1991, P IEEE INFOCOM, P1206

[2] SNA NETWORKS OF SMALL SYSTEMS [J].