Cooperative Regenerating Codes for Distributed Storage Systems
Author:
- Kenneth W. ShumKSKenneth W. Shum
- 1 June 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15503607,p. 1-5
Abstract
When there are multiple storage node failures in distributed storage system, regenerating them individually is suboptimal as far as repair bandwidth minimization is concerned. The tradeoff between storage and repair bandwidth is derived in the case where data exchange among the newcomers is enabled. The tradeoff curve with cooperation is strictly better than the one without cooperation. An explicit construction of cooperative regenerating code is given.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Fractional repetition codes for repair in distributed storage systems2010
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- A flexible class of regenerating codes for distributed storage2010
- Exact-repair MDS codes for distributed storage using interference alignment2010
- MFR: Multi-Loss Flexible Recovery in Distributed Storage Systems2010
- Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network CodingIEEE Journal on Selected Areas in Communications, 2010
- Reducing repair traffic for erasure coding-based storage via interference alignment2009
- Network Coding for Distributed Storage Systems2007
- OceanStore2000
- Network information flowIEEE Transactions on Information Theory, 2000