Name
Abstract | ||
|---|---|---|
In practical large-scale distributed storage systems, node failures are unavoidable. It is therefore desirable to quickly recreate the failed nodes in order to maintain the system integrity. In this letter, we consider a family of erasure codes that provide uncoded repair, where the failed node is regenerated by transfer of data without extra arithmetic operations. We introduce flexible fractional repetition (FFR) code, of which the coding scheme is a concatenation of an outer MDS code and an inner repetition code. Our proposed codes are applicable to the heterogeneous network environment where node storage capacities and packet repetition degrees vary in a wide range. We present explicit constructions of FFR codes by utilizing combinatorial designs. We further propose a heuristic code construction. Evaluation results show that FFR codes outperform regenerating codes in node repair efficiency. © 1997-2012 IEEE. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/LCOMM.2015.2415495 | IEEE Communications Letters |
Keywords | Field | DocType |
Maintenance engineering,Decision support systems,Vectors,Encoding,Bandwidth,Computers,Complexity theory | Concatenated error correction code,Repetition code,Computer science,Fountain code,Turbo code,Block code,Distributed data store,Computer network,Linear code,Erasure code,Distributed computing | Journal |
Volume | Issue | ISSN |
19 | 6 | 1089-7798 |
Citations | PageRank | References |
11 | 0.58 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhu Bing | 1 | 75 | 10.85 |
| Kenneth W. Shum | 2 | 87 | 7.09 |
| Li Hui | 3 | 173 | 34.14 |