Extension of segment protection for bandwidth efficiency and differentiated quality of protection in optical/MPLS networks

This paper investigates the problem of dynamic survivable lightpath provisioning against single-node/link failures in optical mesh networks employing wavelength-division multiplexing (WDM). We unify various forms of segment protection into generalized segment protection (GSP). In GSP, the working path of a lightpath is divided into multiple overlapping working segments, each of which is protected by a node-/link-disjoint backup segment. We design an efficient heuristic which, upon the arrival of a lightpath request, dynamically divides a judiciously selected working path into multiple overlapping working segments and computes a backup segment for each working segment while accommodating backup sharing. Compared to the widely considered shared-path protection scheme, GSP achieves much lower blocking probability and shorter protection-switching time for a small sacrifice in control and management overhead. On the basis of generalized segment protection, we present a new approach to provisioning lightpath requests according to their differentiated quality-of-protection (QoP) requirements. We focus on one of the most important QoP parameters-namely, protection-switching time-since lightpath requests may have differentiated protection-switching-time requirements. For example, lightpaths carrying voice traffic may require 50 ms protection-switching time while lightpaths carrying data traffic may have a wide range of protection-switching-time requirements. Numerical results show that our approach achieves significant performance gain which leads to a remarkable reduction in blocking probability. While our focus is on the optical WDM network, the basic ideas of our approaches can be applied to multi-protocol label switching (MPLS) networks with appropriate adjustments, e.g., differentiated bandwidth granularities.

[1]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[2]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Nirwan Ansari,et al.  Restoration with wavelength conversion in WDM networks , 2002 .

[4]  Eric Bouillet,et al.  Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths , 2002, Optical Fiber Communication Conference and Exhibit.

[5]  T. V. Lakshman.  Capacity design of fast path restorable optical networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

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

[8]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[9]  Biswanath Mukherjee,et al.  Sub-path protection for scalability and fast recovery in WDM mesh networks , 2002, Optical Fiber Communication Conference and Exhibit.

[10]  Chadi Assi,et al.  Efficient path selection and fast restoration algorithms for shared restorable optical networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[11]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[12]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  B. Mukherjee,et al.  New and improved approaches for shared-path protection in WDM mesh networks , 2004, Journal of Lightwave Technology.

[14]  J. Li,et al.  Shared sub-path protection with overlapped protection areas in WDM networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[15]  M. Medard,et al.  Capacity versus robustness: a tradeoff for link restoration in mesh networks , 2000, Journal of Lightwave Technology.

[16]  Suresh Subramaniam,et al.  Trade-offs between speed, capacity, and restorability in optical mesh network restoration , 2002, Optical Fiber Communication Conference and Exhibit.

[17]  Andrea Fumagalli,et al.  Shared path protection with differentiated reliability , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[18]  Chunming Qiao,et al.  Sub-path Protection: A New Framework for Optical Layer Survivability and its Quantitative Evaluation , 2002 .

[19]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[20]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[22]  Murari Sridharan,et al.  On improving partial information routing with segmented path protection , 2002, Proceedings. International Conference on Parallel Processing Workshop.

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

[24]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

[25]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[26]  Koushik Kar,et al.  Routing restorable bandwidth guaranteed connections using maximum 2-route flows , 2003, TNET.

[27]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[28]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[29]  H. T. Mouftah,et al.  A novel strategy for protection domain allocation in dynamic mesh WDM networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[30]  Byrav Ramamurthy,et al.  A dynamic partitioning sub-path protection routing technique in WDM mesh networks , 2002 .

[31]  Eytan Modiano,et al.  Partial path protection for WDM networks: end-to-end recovery using local failure information , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[32]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  Chunming Qiao,et al.  Achieving fast and bandwidth-efficient shared-path protection , 2003 .

[34]  C.-F. Su,et al.  Protection path routing on WDM networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[35]  Biswanath Mukherjee,et al.  Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks , 2002, TNET.

[36]  Biswanath Mukherjee,et al.  Sub-Path Protection for Scalability and Fast Recovery , 2005 .