Cooperative Regenerating Codes for Distributed Storage Systems
Kenneth W. Shum
TL;DR
This paper introduces cooperative regenerating codes that enable multiple failed nodes to be repaired simultaneously with data exchange among newcomers, optimizing the tradeoff between repair bandwidth and storage efficiency.
Contribution
It provides an explicit and optimal construction of cooperative regenerating codes for distributed storage systems.
Findings
Cooperative regenerating codes reduce repair bandwidth compared to individual repair.
The paper presents an explicit construction of optimal cooperative codes.
Enabling data exchange among newcomers improves repair efficiency.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.