Cooperative Regenerating Codes for Distributed Storage Systems
arXiv:1101.5257 · doi:10.1109/icc.2011.5962548
Abstract
When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-bandwidth minimization is concerned. If data exchange among the newcomers is enabled, we can get a better tradeoff between repair bandwidth and the storage per node. An explicit and optimal construction of cooperative regenerating code is illustrated.
5 pages, 7 figures, to appear in Proc. IEEE ICC, 2011
Cited by in corpus (28)
- In-Network Redundancy Generation for Opportunistic Speedup of Backup
- CROSS-MBCR: Exact Minimum Bandwith Coordinated Regenerating Codes
- Byzantine Fault Tolerance of Regenerating Codes
- Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems
- Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Cooperative Regenerating Codes
- Secure Partial Repair in Wireless Caching Networks with Broadcast Channels
- Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding
- An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems
- Exact Scalar Minimum Storage Coordinated Regenerating Codes
- When and By How Much Can Helper Node Selection Improve Regenerating Codes?
- Storage codes -- coding rate and repair locality
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems
- Distributed Storage over Unidirectional Ring Networks
- Repair for Distributed Storage Systems with Erasure Channels
- An Overview of Codes Tailor-made for Better Repairability in Networked Distributed Storage Systems
- Decentralized Minimum-Cost Repair for Distributed Storage Systems
- Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions
- Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage
- Concurrent Regenerating Codes and Scalable Application in Network Storage
- Optimal Construction of Regenerating Code through Rate-matching in Hostile Networks
- Beyond the MDS Bound in Distributed Cloud Storage
- Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems
- Repairing Multiple Failures in the Suh-Ramchandran Regenerating Codes
- Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage
- Scalar MSCR Codes via the Product Matrix Construction