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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.