Performance analysis of fast distributed network restoration algorithms

Performance analysis of fast distributed network restoration algorithms

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 in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bicknell, J., Chow, C.E., Syed, S.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Aggregates
Algorithm design and analysis
Analytical models
Computer network management
Computer science
Intelligent networks
Measurement
Performance analysis
Springs
Telecommunication network management
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
DOI:10.1109/GLOCOM.1993.318339