Performance analysis of fast distributed link restoration algorithms

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.

[1]  Keiji Miyazaki,et al.  A distributed restoration algorithm for multiple-link and node failures of transport networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[2]  D. K. Doherty,et al.  High capacity digital network management and control , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[3]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[4]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[5]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[6]  Donald M. Topkis,et al.  A k shortest path algorithm for adaptive routing in communications networks , 1988, IEEE Trans. Commun..

[7]  J. S. Whalen,et al.  Finding maximal link disjoint paths in a multigraph , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[8]  Jeffrey M. Jaffe,et al.  SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..

[9]  J. Limb,et al.  Editorial on the IEEE/OSA Journal of Lightwave Technology and the IEEE Journal on Selected Areas in Communications , 1986 .

[10]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[11]  Leo A. Wrobel.  Disaster recovery planning for telecommunications , 1990 .

[12]  C. E. Chow,et al.  RREACT: A Distributed Protocol for Rapid Restoration of Active Communication Trunks , 1993 .

[13]  C. Edward Chow,et al.  RREACT: A Distributed Network Restoration Protocol for Rapid Restoration of Active Communication Trunks , 1994 .

[14]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  J. Bicknell,et al.  A fast distributed network restoration algorithm , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[17]  F. Hummel,et al.  Restoration in a partitioned multi-bandwidth cross-connect network , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[18]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[19]  Jean Bovet.  Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau , 1986, Discret. Appl. Math..

[20]  Baruch Awerbuch,et al.  Approximate distributed Bellman-Ford algorithms , 1994, IEEE Trans. Commun..

[21]  Wayne D. Grover,et al.  Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[22]  J. Bovet.  An improvement on Dijkstra's method for finding the shortest path in a network , 1986 .

[23]  H. Kobrinski,et al.  Distributed control algorithms for dynamic restoration in DCS mesh networks: performance evaluation , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[24]  B. Carré.  An Algebra for Network Routing Problems , 1971 .

[25]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[26]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[27]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[28]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[29]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[30]  Wayne Davy Grover.  Self-healing networks: a distributed algorithm fork-shortest link-disjoint paths in a multigraph with applications in real-time network restoration , 1989 .

[31]  Liang T. Wu,et al.  Using distributed topology update and preplanned configurations to achieve trunk network survivability , 1991 .

[32]  Dimitri P. Bertsekas,et al.  RELAXT-III : a new and improved version of the RELAX code , 1990 .

[33]  J. E. Baker,et al.  A distributed link restoration algorithm with robust preplanning , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.