TY - GEN
T1 - Linear exact repair rate region of (k + 1, k, k) distributed storage systems
T2 - IEEE International Symposium on Information Theory, ISIT 2015
AU - Elyasi, Mehran
AU - Mohajer, Soheil
AU - Tandon, Ravi
N1 - Publisher Copyright: © 2015 IEEE.
PY - 2015/9/28
Y1 - 2015/9/28
N2 - Characterizing the exact repair storage-vs-repair bandwidth tradeoff for distributed storage systems remains an open problem for more than four storage nodes. Motivated by the prevalence and practical applicability of linear codes, the exact repair problem when restricted to linear codes is considered. The main result of this paper is a new approach to develop bounds for exact repair distributed storage systems with linear codes (LDSS). Using this approach, the exact repair region for the (k + 1, k, k) LDSS is completely characterized. The new approach utilizes the properties of linear codes together with the exact repair constraints. These constraints are formally captured through an optimization problem with a recursive structure, and its solution finally yields the new bounds for the LDSS. These bounds together with recent code constructions characterize the exact repair region for (k + 1, k, k) LDSS.
AB - Characterizing the exact repair storage-vs-repair bandwidth tradeoff for distributed storage systems remains an open problem for more than four storage nodes. Motivated by the prevalence and practical applicability of linear codes, the exact repair problem when restricted to linear codes is considered. The main result of this paper is a new approach to develop bounds for exact repair distributed storage systems with linear codes (LDSS). Using this approach, the exact repair region for the (k + 1, k, k) LDSS is completely characterized. The new approach utilizes the properties of linear codes together with the exact repair constraints. These constraints are formally captured through an optimization problem with a recursive structure, and its solution finally yields the new bounds for the LDSS. These bounds together with recent code constructions characterize the exact repair region for (k + 1, k, k) LDSS.
UR - http://www.scopus.com/inward/record.url?scp=84969758628&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969758628&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2015.7282818
DO - 10.1109/ISIT.2015.7282818
M3 - Conference contribution
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2061
EP - 2065
BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 14 June 2015 through 19 June 2015
ER -