Minimizing disaster backup window for geo-distributed multi-datacenter cloud systems

Author

Jingjing Yao ; Ping Lu ; Zuqing Zhu

Author_Institution

Sch. of Inf. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2014

fDate

10-14 June 2014

Firstpage

3631

Lastpage

3635

Abstract

We optimize the disaster backup in multi-datacenter (multi-DC) cloud systems and design disaster-aware algorithms to realize rapid backup with the objective of minimizing the backup window for all the DCs in the network. A mixed integer linear programming (MILP) model is first formulated to optimize the backup processes of all production DCs jointly. We then develop three heuristics that use the one-step or two-step approaches for the selection of backup DCs and the calculation of backup routing paths. Simulation results show that the Two-Step algorithm can achieve the shortest backup window with the lowest operation complexity.

Keywords

cloud computing; computer centres; computer networks; disasters; distributed processing; geographic information systems; integer programming; linear programming; MILP model; backup DC selection; backup routing paths; disaster backup window minimization; disaster-aware algorithm design; geo-distributed multidata center cloud systems; heuristics; mixed integer linear programming model; multiDC cloud systems; operation complexity; shortest backup window; two-step approach; Algorithm design and analysis; Bandwidth; Computational modeling; Heuristic algorithms; Production; Routing; Throughput; Backup window; Multi-datacenter networks; Mutual backup model;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (ICC), 2014 IEEE International Conference on

Conference_Location

Sydney, NSW

Type

conf

DOI

10.1109/ICC.2014.6883885

Filename

6883885