Name
Abstract | ||
|---|---|---|
The fundamental theorem of distributed storage systems characterizes the maximum file size that can be stored with certain assumptions on file retrieval and node repair. The result is composed of two parts, namely, the min-cut bound and that the bound can be achieved by linear network code with bounded field size. The derivation of the min-cut bound is reexamined and illuminated by making an implicit step explicit. Furthermore, a simple alternative proof for the achievability of the min-cut bound is presented, which is based on the construction of the generic storage code, a restricted form of generic network code. The proof techniques in this paper are expected to be extensible to other more complex models of distributed storage systems. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ITW.2014.6970793 | ITW |
Keywords | DocType | ISSN |
information flow graph,min-cut bound,node repair,distributed memory systems,storage management,distributed storage systems,linear network code,generic network code restricted form,generic storage code,file retrieval,graph theory,network coding | Conference | 1662-9019 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Hu | 1 | 9 | 2.89 |
| Kenneth W. Shum | 2 | 544 | 56.37 |
| Chi Wan Sung | 3 | 779 | 91.41 |