Optimization for Reliable Erasure-Coded Storage Allocation Under Multiple Constraints
The large-scale cloud storage systems are comprised of together nodes from different sources and with different characteristics. The storage reliability has attracted much concern due to frequent failures. 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. The authors 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.