Disaster Protection in Inter-DataCenter Networks Leveraging Cooperative Storage

• Published in: IEEE eTransactions on network and service management Vol. 18; no. 3; pp. 2598 - 2611
• Main Authors: Liu, Yuanhao, Zhou, Fen, Chen, Cao, Zhu, Zuqing, Shang, Tao, Torres-Moreno, Juan-Manuel
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptive systems; Algorithms; Cascading style sheets; Computer Science; cooperative storage system (CSS); Disaster management; disaster resilience; Disasters; elastic optical networks; Engineering Sciences; Heuristic methods; Indexing; Inter-datacenter networks; Natural disasters; Network topology; Optical communication; Optical fiber networks; Provisioning; Resilience; Route planning; Routing; Survivability; Topology
• ISSN: 1932-4537; 1932-4537
• DOI: 10.1109/TNSM.2021.3089049

Natural disasters have challenged the survivability of Elastic Optical Inter-DataCenter Networks (EO-DCNs), and it is urgent to establish efficient disaster protection schemes. In this paper, we investigate the disaster-resilient service provisioning problem leveraging cooperative storage system (CSS). Instead of mirrored content backup on a single DC, our proposed CSS partitions a required content into no less than three fragments if possible, each of which is then stored on a DC located in different disaster zones. Accordingly, multi-path routing with the adaptive number of working paths to distinct DCs is employed to serve each request, while a protection path is computed to protect against a disaster failure. Our main objective is to jointly minimize the spectrum usage and maximal occupied frequency slot index (MOFI) subject to disaster resilience. Besides, we also expect to cut the content storage space. To this end, we propose for the first time a CSS-based dedicated end-to-content path protection (CDP), which allows service provisioning through multiple paths with the adaptive number of paths rather than a single path. This consequently reduces at least half of the reserved spectrum on the protection path. To find the optimal CDP strategy, we formulate the studied problem as an integer linear program (ILP) and then propose a fast heuristic algorithm. Observing the trade-off between the spectrum usage and content storage space, we further design a maximum-CDP (M-CDP), which generates the maximum number of working paths to reduce the content storage space. Simulations are conducted to compare the proposed schemes with the traditional protection strategy using mirrored storage and single-path routing. Numerical results demonstrate that the proposed CSS-based protection schemes enable to cut up to 21.6% of the spectrum usage and 15% of the content storage space.