DocumentCode
3315686
Title
Optimization for reliable erasure-coded storage allocation under multiple constraints
Author
Guangping Xu ; Xing Guo ; Hua Zhang ; Sheng Lin ; Chunxia Yang
Author_Institution
Comput. & Commun. Eng. Sch., Tianjin Univ. of Technol., Tianjin, China
fYear
2013
fDate
6-8 Dec. 2013
Firstpage
1
Lastpage
2
Abstract
To maximize the reliability of erasure coded objects in cloud storage, the optimal allocation is a challenging problem constrained with the node heterogeneities and erasure coding budgets. We model the optimal problem from a combinatorial view under multiple constraints and propose an efficient search algorithm to find the most reliable allocation. The experiments are evaluated and analyzed including the optimal reliability, redundancy reduction and allocation pattern.
Keywords
cloud computing; combinatorial mathematics; dynamic programming; forward error correction; redundancy; storage allocation; cloud storage; combinatorial view; dynamic programming; erasure-coded storage allocation reliability; multiple constraint; multiple constraints; node heterogeneities; redundancy reduction; Availability; Bandwidth; Encoding; Peer-to-peer computing; Redundancy; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Performance Computing and Communications Conference (IPCCC), 2013 IEEE 32nd International
Conference_Location
San Diego, CA
Print_ISBN
978-1-4799-3213-9
Type
conf
DOI
10.1109/PCCC.2013.6742753
Filename
6742753
Link To Document