Risk‐aware last‐minute data backup in inter‐datacenter networks. Issue 5 (1st September 2019)

• Record Type: Journal Article
• Authors: Das, Shrayan; Panda, Kirtan Gopal; Sen, Debarati; Arif, Wasim
• Is Part Of: IET networks. Volume 8:Issue 5(2019)
• Page Start: 307
• Page End: 320
• Publication Date: 2019-09-01
• Subjects: linear programming -- integer programming -- computer centres -- computer networks -- computer network reliability -- minimisation -- probability -- communication complexity -- numerical analysis; communication disruption -- backbone datacenter networks -- large‐scale network disruptions -- data‐transfer algorithms -- mutual backup model -- DC‐B‐Wnd -- probabilistic backup site selection -- mixed‐integer linear programming models -- backup time minimisation -- single DC backups -- dual DC backups -- risk‐aware probabilistic path selection -- interdatacenter networks -- risk‐aware last‐minute data backup -- electromagnetic pulse attacks -- optical interDC networks -- network disruption prevention -- DC‐backup‐window -- optimisation -- numerical simulations -- computational complexity; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2018.5107
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : Network failure caused by disasters (both natural and man‐made like earthquakes, floods, cyclones, electromagnetic pulse attacks etc.) result in communication disruption and huge amounts of data loss in the backbone datacenter (DC) networks. To prevent such large‐scale network disruptions and quickly resume connectivity after the disaster, network operators require improved and efficient data‐transfer algorithms in geographically distributed (geo‐distributed) optical inter‐DC networks. Minimising loss of infrastructure and preventing network disruption requires estimating the damage from a possible disaster. In this study, the authors consider a mutual backup model, where DCs can serve as backup sites of each other, thereby significantly reducing the backup duration (i.e. DC‐Backup‐Window (DC‐B‐Wnd)). They specifically consider the joint optimisation of probabilistic backup site selection and the amount of data to be backed up. They propose mixed‐integer linear programming models for backup time minimisation using a single DC as well as dual DCs at backup sites. Further, they investigate the trade‐off between DC‐B‐Wnd and the computational complexity of the proposed algorithms and perform extensive numerical simulations to show that, in the case of disasters, single and dual DC backups with risk‐aware probabilistic path selection give shorter backup windows as compared to existing algorithms.