Load-Balanced Fractional Repetition Codes
Alexandra Porter, Shashwat Silas, Mary Wootters
TL;DR
This paper introduces load-balanced fractional repetition (LBFR) codes that improve network efficiency and reduce disk reads during multiple node repairs by ensuring sequential repair with minimal data download from each node.
Contribution
The paper characterizes LBFR codes via adjacency graphs and provides explicit constructions that match or surpass existing FR codes in certain parameters.
Findings
LBFR codes enable sequential repair with minimal data download.
Explicit constructions of LBFR codes are provided.
LBFR codes can match the parameters of the best existing FR codes.
Abstract
We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node. This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes. We characterize LBFR codes in terms of their adjacency graphs, and use this characterization to present explicit constructions LBFR codes with storage capacity comparable existing FR codes. Surprisingly, in some parameter regimes, our constructions of LBFR codes match the parameters of the best constructions of FR codes.
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.