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 of LBFR codes with storage capacity comparable to existing FR codes. Surprisingly, in some parameter regimes, our constructions of LBFR codes match the parameters of the best constructions of FR codes. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/ISIT.2018.8437460 | 2018 IEEE International Symposium on Information Theory (ISIT) |
Keywords | DocType | Volume |
Fractional repetition codes,distributed storage,repair-by-transfer | Conference | abs/1802.00872 |
ISBN | Citations | PageRank |
978-1-5386-4102-6 | 0 | 0.34 |
References | Authors | |
8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alexandra Porter | 1 | 8 | 1.62 |
Shashwat Silas | 2 | 0 | 1.35 |
Mary Wootters | 3 | 172 | 25.99 |