Shared end-to-content backup path protection in k-node (edge) content connected elastic optical datacenter networks.

To quantitatively measure content connectivity and provide protection for different kinds of content, the concept of k-node (edge) content connectivity is proposed recently. Based on k-node (edge) content connectivity, k-node (edge) content connected elastic optical datacenter network (KC-EODN) is proposed to design disaster-resilient and spectrum-efficient optical datacenter networks. In KC-EODN, k independent end-to-content paths are established for each request. However, it will consume too much resource to assign dedicated spectrum for each end-to-content path. Spectrum sharing among multiple end-to-content paths of different requests can greatly improve resource efficiency. In this paper, a novel perfect matching based sharing principle among multiple end-to-content paths of different requests is proposed. Based on the new proposed sharing principle, we present the shared end-to-content backup path protection (SEBPP) scheme for KC-EODN. Integer linear program (ILP) model and heuristic algorithms are designed for SEBPP scheme with the objective of minimizing the total of working and backup spectrum resources. Numerical results show that the proposed SEBPP scheme can greatly reduce spectrum consumption while ensuring the survivability against natural disaster and multi-failures.

[1]  J. Munkres ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[2]  Yang Wang,et al.  Bandwidth-adaptability protection with content connectivity against disaster in elastic optical datacenter networks , 2015, Photonic Network Communications.

[3]  Wanyi Gu,et al.  Pre-configured polyhedron based protection against multi-link failures in optical mesh networks. , 2014, Optics express.

[4]  Chao Wang,et al.  Distance Adaptive Dynamic Routing and Spectrum Allocation in Elastic Optical Networks With Shared Backup Path Protection , 2015, Journal of Lightwave Technology.

[5]  Wanyi Gu,et al.  Design of K-Node (Edge) Content Connected Optical Data Center Networks , 2016, IEEE Communications Letters.

[6]  Lei Guo,et al.  A Novel Survivable Routing Algorithm With Partial Shared-Risk Link Groups (SRLG)-Disjoint Protection Based on Differentiated Reliability Constraints in WDM Optical Mesh Networks , 2007, Journal of Lightwave Technology.

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

[8]  M. Tornatore,et al.  Survivable Traffic Grooming in Elastic Optical Networks—Shared Protection , 2013, Journal of Lightwave Technology.

[9]  Yue Wei,et al.  Optimal design for shared backup path protected elastic optical networks under single-link failure , 2014, IEEE/OSA Journal of Optical Communications and Networking.

[10]  M. Zukerman,et al.  Novel Node-Arc Model and Multiiteration Heuristics for Static Routing and Spectrum Assignment in Elastic Optical Networks , 2013, Journal of Lightwave Technology.

[11]  Masahiko Jinno,et al.  Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies , 2009, IEEE Communications Magazine.

[12]  Ioannis Tomkos,et al.  Elastic Bandwidth Allocation in Flexible OFDM-Based Optical Networks (vol 29, pg 1354, 2011) , 2011 .

[13]  M. Tornatore,et al.  Design of Disaster-Resilient Optical Datacenter Networks , 2012, Journal of Lightwave Technology.

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

[15]  Jin Cao,et al.  On Finding Feasible Solutions With Shared Backup Resources for Surviving Double-Link Failures in Path-Protected WDM Mesh Networks , 2007, Journal of Lightwave Technology.