DocumentCode :
2560270
Title :
Data migration in the scalable storage cloud
Author :
Petrov, Dmitry L. ; Tatarinov, Yury S.
Author_Institution :
Fac. of Comput. Technol. & Inf., St. Petersburg Electrotech. Univ. LETI, St. Petersburg, Russia
fYear :
2009
fDate :
12-14 Oct. 2009
Firstpage :
1
Lastpage :
4
Abstract :
Data migration within storage cloud is complicated due to the necessity of scaling the cloud. Dividing migration is proposed to speed up scaling. Migration is divided into scaling and residual migration. The problem of data migration within storage cloud is defined as a multi-criterion optimization problem of data relocation plan. The main criterion of the optimization is scaling speed. The second criterion is residual migration speed. In general, the problem of data migration is NP-hard. Polynomial time approximation algorithm is presented in this article. The another result of this work is a prove of optimality algorithm by the first criterion.
Keywords :
computational complexity; distributed algorithms; optimisation; NP-hard problem; data migration; data relocation plan; multicriterion optimization problem; polynomial time approximation algorithm; residual migration; scalable storage cloud; scaling migration; Approximation algorithms; Cloud computing; Computer networks; Degradation; Informatics; NP-hard problem; Polynomials; Scalability; computing cloud; data migration; scalable storage; storage cloud;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Ultra Modern Telecommunications & Workshops, 2009. ICUMT '09. International Conference on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4244-3942-3
Electronic_ISBN :
978-1-4244-3941-6
Type :
conf
DOI :
10.1109/ICUMT.2009.5345514
Filename :
5345514
Link To Document :
بازگشت