A Cooperative Repair Scheme for Zigzag MSR Codes in Distributed Storage Systems
Yajuan Liu, Han Cai, and Xiaohu Tang
TL;DR
This paper introduces a new cooperative repair scheme for Zigzag MSR codes in distributed storage systems, achieving optimal repair bandwidth and reducing finite field size, thus improving repair efficiency and practicality.
Contribution
It presents the first optimal cooperative repair scheme for Zigzag MSR codes, significantly reducing finite field size compared to previous methods.
Findings
Achieves optimal repair bandwidth for Zigzag MSR codes
Supports repair of any h failed nodes
Reduces finite field size to Fq, q >= n+1
Abstract
In this paper, we propose a novel cooperative repair scheme for Zigzag MSR codes with optimal repair bandwidth, enabling the repair of any h failed nodes. To the best of our knowledge, this is the first optimal cooperative repair scheme for Zigzag MSR codes. Compared to previous cooperative repair schemes for MSR codes, our scheme significantly reduces the size of the finite field to Fq,q>=n+1.
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 · Distributed systems and fault tolerance · Caching and Content Delivery