Spectrum-Sharing-Maximized Approaches With Shared-Path Protection in Elastic Optical Data Center Networks
Bowen Chen, Lei Yu, Yunfei Jiang, Qi Chen, Jinbing Wu, Weidong Shao, Mingyi Gao, Pin‐Han Ho
Abstract
The spectrum efficiency is a greatly important issue when we establish connection requests in elastic optical data center networks (EODCNs). In this article, we address the spectrum efficiency problems of the shared-path protection with spectrum-sharing-maximized approaches for the optical network survivability. Two integer linear program (ILP) models, i.e., flow-based and path-based ILP models, named FB-ILP and PB-ILP, are developed to minimize the frequency slots (FSs) occupied with the spectrum-sharing-maximized protection, and two heuristic approaches with the spectrum-sharing-maximized protection (HA-SSMP) and with the general spectrum-sharing protection (HA-GSSP) are also proposed to improve spectrum efficiency in EODCNs. For comparison, we introduce a heuristic approach with the existing shared-path protection (HA-ESPP) in EODCNs. On the one hand, simulation results show that FB-ILP can minimize the number of FSs occupied, but leads to the higher average number of hops and longer running time compared to PB-ILP, HA-SSMP, HA-GSSP, and HA-ESPP in static traffic scenario in EODCNs. On the other hand, the simulation results of our proposed HA-SSMP are very close to the solutions of FB-ILP. In dynamic traffic scenario, simulation results show that HA-SSMP significantly improves the spectrum efficiency and effectively suppresses the blocking probability, but leads to the higher average number of hops compared to HA-GSSP and HA-ESPP in EODCNs.