TY - GEN
T1 - Capacity of dynamical storage systems
AU - Elishco, Ohad
AU - Barg, Alexander
N1 - Funding Information:
The authors are with ISR/Dept. of ECE, University of Maryland, College Park, MD 20817, USA, emails ohadeli@umd.edu and abarg@umd.edu. A. Barg is also with Inst. Inform. Trans. Probl., Russian Academy of Sciences, Moscow, Russia. Research supported by NSF grants CCF1618603 and CCF1814487.
Funding Information:
Research supported by NSF grants CCF1618603 and CCF1814487.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/7/1
Y1 - 2019/7/1
N2 - We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n - n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k - n1)2) symbols compared to the static model.
AB - We define a time-dependent model of erasure coding for distributed storage and estimate the average capacity of the network in the simple case of fixed link bandwidth that takes one of two given values. We show that if k data blocks are encoded into n blocks placed on n nodes of which n1 have links with bandwidth greater than the remaining n - n1 nodes by γ symbols, then the average capacity increases by Ω(γ(k - n1)2) symbols compared to the static model.
UR - http://www.scopus.com/inward/record.url?scp=85073150064&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849745
DO - 10.1109/ISIT.2019.8849745
M3 - Conference contribution
AN - SCOPUS:85073150064
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1562
EP - 1566
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
Y2 - 7 July 2019 through 12 July 2019
ER -