A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
Xing Lin, Han Cai, and Xiaohu Tang
TL;DR
This paper introduces a new repair scheme for MDS codes that achieves optimal bandwidth for multiple node failures and has a low data access requirement, improving efficiency in distributed storage systems.
Contribution
It presents a novel repair scheme for MDS codes with optimal bandwidth and reduced data access, enhancing cooperative repair methods.
Findings
Achieves optimal bandwidth for multiple failed nodes.
Has low data access, less than twice the optimal.
Improves efficiency of cooperative repair schemes.
Abstract
In this paper, a new repair scheme for a modified construction of MDS codes is studied. The obtained repair scheme has optimal bandwidth for multiple failed nodes under the cooperative repair model. In addition, the repair scheme has relatively low access property, where the number of data accessed is less than two times the optimal value.
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.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cooperative Communication and Network Coding · Cellular Automata and Applications