CROSS-MBCR: Exact Minimum Bandwith Coordinated Regenerating Codes
arXiv:1207.0854
Abstract
We study the exact and optimal repair of multiple failures in codes for distributed storage. More particularly, we provide an explicit construction of exact minimum bandwidth coordinated regenerating codes (MBCR) for n=d+t,k,d >= k,t >= 1. Our construction differs from existing constructions by allowing both t>1 (i.e., repair of multiple failures) and d>k (i.e., contacting more than k devices during repair).
ISIT 2012 - Recent Results Poster Session
References in corpus (2)
Cited by in corpus (6)
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Cooperative Regenerating Codes
- Information-theoretically Secure Erasure Codes for Distributed Storage
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Cooperative Repair of Multiple Node Failures in Distributed Storage Systems
- Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes