Rack-Aware Regenerating Codes with Fewer Helper Racks
Zhifang Zhang, Liyang Zhou

TL;DR
This paper introduces a new class of rack-aware regenerating codes that optimize the tradeoff between storage overhead and cross-rack repair bandwidth, especially when the number of helper racks is less than the number of racks needed for data reconstruction.
Contribution
The paper establishes a novel tradeoff between storage and repair bandwidth for <, and provides explicit code constructions at key points on this tradeoff curve.
Findings
Codes operate over finite fields of size comparable to n.
Codes combine advantages of regenerating and locally repairable codes.
Codes relax restrictions of traditional MBR and MSR codes.
Abstract
We consider the rack-aware storage system where \(n\) nodes are organized in \(\bar{n}\) racks each containing \(u\) nodes, and any \(k\) nodes can retrieve the stored file. Moreover, any single node erasure can be recovered by downloading data from \(\bar{d}\) helper racks as well as the remaining \(u\!-\!1\) nodes in the same rack. Previous work mostly focuses on minimizing the cross-rack repair bandwidth under the condition \(\bar{d}\geq \bar{k}\), where \(\bar{k}=\lfloor\frac{k}{u}\rfloor\). However, \(\bar{d}\geq \bar{k}\) is not an intrinsic condition for the rack-aware storage model. In this paper, we establish a tradeoff between the storage overhead and cross-rack repair bandwidth for the particularly interesting case \(\bar{d}\!<\!\bar{k}\). Furthermore, we present explicit constructions of codes with parameters lying on the tradeoff curve respectively at the minimum storage…
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 · Caching and Content Delivery · Cellular Automata and Applications
