Capacity versus robustness: a tradeoff for link restoration in mesh networks

Link recovery in high-speed four-fiber networks can be achieved using dynamic searches, covers of rings, or generalized loopback. We present a method to provide link recovery for all links in a network without using all links for backup traffic transmission. The method extends generalized loopback to operate on a subgraph of the full backup graph. The backup capacity on such links can then be used to carry unprotected traffic, i.e., traffic that is not recovered in case of a failure, while primary fibers on the links retain failure protection. Although all primary fibers remain fully robust to single-link failures, reserving links for unprotected traffic reduces a network's ability to recover from multiple failures. We explore the tradeoff between capacity and robustness to two-link failures for several typical high-speed optical fiber networks, comparing the properties of three link-restoration algorithms based on generalized loopback with the properties of covers of rings. Our results demonstrate robustness comparable or superior to that available with covers of rings while providing an additional unprotected traffic capacity of roughly 20% of the network's primary capacity.

[1]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

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

[3]  Y. Yamabayashi,et al.  Self-healing algorithm for logical mesh connection on ring networks , 1994 .

[4]  Muriel Médard,et al.  WDM loop-back recovery in mesh networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. II. Restoration , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

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

[7]  Wayne D. Grover,et al.  Mesh/arc networking: an architecture for efficient survivable self-healing networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[8]  O. J. Wasem Optimal topologies for survivable fiber optic networks using SONET self-healing rings , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[9]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[10]  Tsong-Ho Wu A passive protected self-healing mesh network architecture and applications , 1994, TNET.

[11]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

[13]  Carsten Thomassen On the Complexity of Finding a Minimum Cycle Cover of a Graph , 1997, SIAM J. Comput..

[14]  Piet Demeester,et al.  Spare capacity assignment for different restoration strategies in mesh survivable networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[15]  C. E. Chow,et al.  Performance analysis of fast distributed network restoration algorithms , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[16]  Anindo Banerjea,et al.  Recovering guaranteed performance service connections from single and multiple faults , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[17]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[18]  Wayne D. Grover,et al.  Case studies of survivable ring, mesh and mesh-arc hybrid networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[19]  M.J. O'Mahony,et al.  Distributed restoration strategies in telecommunications networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

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

[21]  R. H. Cardwell,et al.  High-speed self-healing ring architectures for future interoffice networks , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[22]  W. Way,et al.  A novel passive protected SONET bidirectional self-healing ring architecture , 1992 .

[23]  R.S.K. Chng,et al.  A multi-layer restoration strategy for reconfigurable networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[24]  Joseph Sosnosky,et al.  Service applications for SONET DCS distributed restoration , 1994, IEEE J. Sel. Areas Commun..

[25]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[26]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[27]  Thomas Frisanco,et al.  Optimal spare capacity design for various protection switching methods in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[28]  Thomas E. Stern,et al.  Automatic protection switching for link failures in optical networks with bi-directional links , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[29]  John P. Fonseka,et al.  Hierarchical self-healing rings , 1995, TNET.

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

[31]  Noriaki Yoshikai,et al.  Double search self-healing algorithm and its characteristics , 1994 .

[32]  E. L. Hahne,et al.  Fault-tolerant multimesh networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[33]  C. Godsil,et al.  Cycles in graphs , 1985 .