Threshold based selective survivability for optical WDM mesh networks

This paper presents survivability mechanisms that attempt to improve the overall restoration efficiency of dynamic link restoration in optical WDM mesh networks. The proposed mechanisms make use of network state information such as link load in order to identify critical network sections (such as links or segments) that are subsequently protected by selectively assigning backup capacity ahead of failures. The first approach, termed "threshold based selective link restoration", utilizes existing link load information to identify critical links, and the second approach, termed "threshold based selective segment restoration", employs data-analysis techniques to identify critical segments. The overall goal of the proposed algorithms is to improve the restoration efficiency by providing a trade-off between proactive protection and reactive restoration. The experimental results indicate that under high loads, the proposed approaches maintain a consistent restoration efficiency that is at least 10% when compared to dynamic restoration.

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

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

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

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

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

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

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

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

[9]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

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

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

[12]  Krishna M. Sivalingam,et al.  Emerging Optical Network Technologies , 2005 .

[13]  David Thomas,et al.  The Art in Computer Programming , 2001 .

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

[15]  Bo Wen,et al.  Routing, wavelength and time-slot assignment in time division multiplexed wavelength-routed optical WDM networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

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

[18]  P. Green,et al.  Progress in optical networking , 2001, IEEE Commun. Mag..

[19]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.