Hybrid survivability approaches for optical WDM mesh networks

This paper studies the problem of providing recovery from link failures in optical wavelength division multiplexing (WDM) networks. One of the widely studied mechanisms is dynamic link restoration, which provides recovery by determining restoration paths around a link after a failure occurs. This mechanism leads to a lower backup resource utilization, fast failure signaling rate, and a scalable operation. However, one of the main drawbacks of uncoordinated dynamic restoration is the inability to provide a 100% recovery for all connections, especially at high network loads. An alternate solution is proactive protection, where backup capacity is reserved during connection setup that can guarantee recovery under certain conditions (e.g., single link failures) but requires higher backup capacity and has low spare capacity utilization when failures do not occur. This paper presents two hybrid survivability approaches that combine the positive effects of restoration and protection. The proposed algorithms make use of available or collected network state information, such as link load, to identify critical links or segments in the network that are then proactively protected. The overall goal of the proposed approaches is to improve the restoration efficiency by providing a tradeoff between proactive protection and dynamic restoration. This paper presents a detailed performance analysis of the proposed algorithms. Experimental results show that under high loads, both the proposed approaches maintain a consistent restoration efficiency of at least 10%, or higher, when compared to the basic restoration scheme.

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

[2]  Biswanath Mukherjee,et al.  Connection management for survivable wavelength-routed wdm mesh networks , 2001 .

[3]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area optical network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[4]  Krishna M. Sivalingam,et al.  Threshold based selective survivability for optical WDM mesh networks , 2004, First International Conference on Broadband Networks.

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

[6]  Wayne D. Grover,et al.  A highly efficient path-restoration protocol for management of optical network transport integrity , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Ori Gerstel,et al.  Optical layer survivability-an implementation perspective , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[9]  Krishna M. Sivalingam,et al.  Threshold based selective link restoration for optical WDM mesh networks , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

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

[11]  Suresh Subramaniam,et al.  Quality of protection through control-message scheduling in optical mesh networks , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[12]  A. Akhmetova.  Discovery of Frequent Episodes in Event Sequences , 2006 .

[13]  Yu Liu,et al.  Successive survivable routing for node failures , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[14]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[15]  Murari Sridharan,et al.  Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks , 2002, ONDM.

[16]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[17]  W. D. Grover,et al.  Self-organizing broad-band transport networks , 1997, Proc. IEEE.

[18]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[19]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..

[20]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[21]  Wayne D. Grover,et al.  On the efficacy of GMPLS auto-reprovisioning as a mesh-network restoration mechanism , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

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

[24]  Fabián A. Chudak,et al.  Fast optical Layer mesh protection using pre-cross-connected trails , 2002, IEEE/ACM Transactions on Networking.

[25]  Sujata Banerjee,et al.  A survey of adaptive bandwidth control algorithms , 2003, IEEE Communications Surveys & Tutorials.