Design of p-Cycles for Full Node Protection in WDM Mesh Networks

We propose a p-cycle expanded protection scheme that can guarantee 100% node protection, in addition to 100\% protection against single link failures. While some previous studies had already noted that p-cycles can naturally offer some node protection, we show that, at the expense of some p-cycle overlapping, with very mild impact on the bandwidth efficiency, one can guarantee node protection. We propose a design and solution method based on large scale optimization tools, namely Column Generation (CG), that compute p-cycles offering both link and node protection. Previous models offer a solution where a large number of potential cycles needs first to be enumerated, leading to very large ILP models which cannot scale. Comparisons are made between our proposed design approach with the work of Grover and Onguetou (2009). Results show clearly that our approach outperforms their design in terms of capacity efficiency and of the number of distinct cycles. We also evaluate the extra spare capacity requirement of p-cycles for full node protection compared to the one for link protection only. Results shows that p-cycles offering node and link protection only require a slightly larger capacity while the implicit protection against dual link failure is only marginally affected.

[1]  W.D. Grover,et al.  Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection , 2005, Journal of Lightwave Technology.

[2]  Dominic A. Schupke,et al.  The tradeoff between the number of deployed p-cycles and the survivability to dual fiber duct failures , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[3]  Dominic A. Schupke,et al.  Automatic protection switching for p , 2005, Opt. Switch. Netw..

[4]  Wayne D. Grover,et al.  A new approach to node-failure protection with span-protecting p-cycles , 2009, 2009 11th International Conference on Transparent Optical Networks.

[5]  Zhenrong Zhang,et al.  P-Cycles-Based Dynamic Protection Provisioning in Optical WDM Networks , 2005, IEICE Trans. Commun..

[6]  David Coudert,et al.  A new framework for efficient shared segment protection scheme for WDM networks , 2010, 2010 International Conference on High Performance Switching and Routing.

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

[8]  Jan Späth,et al.  A Set of Typical Transport Network Scenarios for Network Modelling , 2004 .

[9]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[10]  Fangcheng Tang,et al.  Dynamic establishment of restorable connections using p-cycle protection in WDM networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[11]  Wayne D. Grover,et al.  A New Insight and Approach to Node Failure Protection with Ordinary p-Cycles , 2008, 2008 IEEE International Conference on Communications.

[12]  W. Marsden I and J , 2012 .

[13]  Brigitte Jaumard,et al.  Revisiting p-Cycles / FIPP p-Cycles vs. Shared Link / Path Protection , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[14]  Wayne D. Grover,et al.  Extending the p-cycle concept to path segment protection for span and node failure recovery , 2003, IEEE J. Sel. Areas Commun..

[15]  Wayne D. Grover,et al.  Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

[16]  Younghwan Yoo,et al.  Adaptive routing considering the number of available wavelengths in WDM networks , 2003, IEEE J. Sel. Areas Commun..