Premium
Performance analysis of fast distributed link restoration algorithms
Author(s) -
Chow C. Edward,
Bicknell John D.,
McCaughey Steve,
Syed Sami
Publication year - 1995
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4500080505
Subject(s) - computer science , link (geometry) , algorithm , backtracking , set (abstract data type) , function (biology) , distributed computing , computer network , evolutionary biology , biology , programming language
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.