Title :
Performance analysis of fast distributed network restoration algorithms
Author :
Bicknell, John ; Chow, C. Edward ; Syed, Sami
Author_Institution :
Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA
fDate :
29 Nov-2 Dec 1993
Abstract :
Six distributed network restoration algorithms are analyzed 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 network 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 algorithms
Keywords :
distributed algorithms; reliability; telecommunication network routing; telecommunications computing; aggregate restoration requests; fast distributed network restoration algorithms; functional characteristics; intelligent backtracking mechanism; performance analysis; performance metrics; simulation results; Aggregates; Algorithm design and analysis; Analytical models; Computer network management; Computer science; Intelligent networks; Measurement; Performance analysis; Springs; Telecommunication network management;
Conference_Titel :
Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE
Conference_Location :
Houston, TX
Print_ISBN :
0-7803-0917-0
DOI :
10.1109/GLOCOM.1993.318339
