Name
Abstract | ||
|---|---|---|
We consider a class of regenerating codes for distributed storage systems that provide exact and uncoded repair at the minimum bandwidth regenerating point. The desirable properties can be achieved by a coding scheme which concatenates an outer MDS code and an inner fractional repetition (FR) code. However, it is desirable to have the more popular packets with higher repetition degrees in practical systems. Motivated by this, we propose a new framework of code design where the repetition degrees of coded packets can be different. By adopting group divisible designs, our framework allows the design of system over a large range of parameters. Moreover, we make use of the systematic feature of MDS codes and wisely partition the storage nodes into several clusters. We show that in normal cases, data reconstruction time can be greatly reduced while contacting nodes in the same cluster. © 2014 IEEE. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/NCC.2014.6811237 | 2014 20th National Conference on Communications, NCC 2014 |
Keywords | Field | DocType |
Distributed storage systems,fractional repetition codes,minimum bandwidth regenerating,group divisible designs | Cluster (physics),Repetition code,Data reconstruction,Computer science,Network packet,Distributed data store,Coding (social sciences),Bandwidth (signal processing),Partition (number theory),Computer engineering,Distributed computing | Conference |
Citations | PageRank | References |
10 | 0.53 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhu Bing | 1 | 75 | 10.85 |
| Li Hui | 2 | 173 | 34.14 |
| Hou Hanxu | 3 | 83 | 14.46 |
| Kenneth W. Shum | 4 | 87 | 7.09 |