Abstract
The exact-repair problem for distributed storage systems is considered. Characterizing the optimal storage-vs-repair bandwidth tradeoff for such systems remains an open problem for more than four storage nodes. A new family of information theoretic bounds is provided for the storage-vs-repair bandwidth tradeoff for all (n, k, d) systems. The proposed bound readily recovers Tian's result for the (4, 3, 3) system, and hence suffices for exact characterization for this system. In addition, the bound improves upon the existing bounds for the (5, 4, 4) system. More generally, it is shown that this bound characterizes the optimal boundary of the exact repair tradeoff for all distributed storage systems, with (n, k, d) = (n, n-1; n-1) when β ≤ 2α/k.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 2056-2060 |
| Number of pages | 5 |
| Volume | 2015-June |
| ISBN (Electronic) | 9781467377041 |
| DOIs | |
| State | Published - Sep 28 2015 |
| Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015 |
Other
| Other | IEEE International Symposium on Information Theory, ISIT 2015 |
|---|---|
| Country/Territory | Hong Kong |
| City | Hong Kong |
| Period | 6/14/15 → 6/19/15 |
Keywords
- Distributed storage system
- Exact repair
- New outer bounds