Name
Abstract | ||
|---|---|---|
In this letter, we focus on fractional repetition (FR) codes, which enable uncoded exact node repair with the minimum disk reads and network bandwidth. We investigate the problem of designing FR codes that also incorporate the preferable property of local repair, i.e., the nodes participating in the repair operation are less than those required for data reconstruction. We propose explicit code constructions based on the combinatorial structure called symmetric design. The benefits of the proposed construction include: 1) each contacted helper node transfers the same amount of data in the repair process, and 2) each failed storage node can have multiple local repair alternatives. © 1997-2012 IEEE. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2605100 | IEEE Communications Letters |
Keywords | Field | DocType |
Maintenance engineering,Redundancy,Bandwidth,Indexes,Fault tolerant systems,Data storage systems | Locality,Data reconstruction,Computer science,Computer network,Real-time computing,Bandwidth (signal processing),Symmetric design | Journal |
Volume | Issue | ISSN |
20 | 12 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||