Comparison of capacity efficiency of DCS network restoration routing techniques

A crucial issue in the management of telecommunications networks is restoration after a network failure. We compare the capacity efficiency (the amount of traffic restored over fixed capacity) of several types of restoration methods for Digital Crossconnect Systems (DCSs) under both node or link failures in metropolitan networks. These restoration methods can be broadly categorized based on the type of control of the restoration process and the type of procedure for rerouting traffic around the failure. It is easily shown that point-to-point methods (where traffic is rerouted end-to-end) restore a higher percent of traffic than patch methods (where traffic is rerouted only around the failed segment). However, quantification of the difference in efficiency among the methods is important to fully evaluate other trade-offs, such as cost and speed of restoration. To evaluate the efficiency difference, we generated random network traffic distributions by simulation and then failed links and nodes for each simulation sample. Statistics were generated on the expected amount of restored traffic for each restoration method. In particular, we found that the efficiency advantage of point-to-point methods over patch methods is greater for link failure than for node failure. Also, the difference was not statistically significant in low levels of network congestion (i.e., networks with large amounts of excess capacity) and became more significant as network congestion increased.

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

[2]  W.D. Grover,et al.  Performance studies of a selfhealing network protocol in Telecom Canada long haul networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[3]  W. D. Grover,et al.  The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .

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

[5]  Hideki Sakauchi,et al.  Design and control issues of integrated self-healing networks in SONET , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[6]  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.

[7]  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 .

[8]  M. P. Vecchi,et al.  A distributed protocol to improve the survivability of trunk networks , 1990, International Symposium on Switching.

[9]  K. R. Krishnan,et al.  Unified Models of Survivability for Multi-Technology Networks , 1994 .

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

[11]  Iraj Saniee,et al.  Optimal Routing Designs in Self-healing Communications Networks , 1996 .

[12]  R. Doverspike A multi-layered model for survivability in intra-LATA transport networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[13]  Robert Doverspike,et al.  Comparison of Routing Methods for DCS-Switched Networks , 1993 .