Technical Program

Paper Detail

Paper Title Capacity of dynamical storage systems
Paper IdentifierWE2.R2.2
Authors Ohad Elishco, Alexander Barg, University of Maryland, College Park, United States
Session Distributed Storage
Location Saint Germain, Level 3
Session Time Wednesday, 10 July, 11:40 - 13:20
Presentation Time Wednesday, 10 July, 12:00 - 12:20
Manuscript  Click here to download the manuscript
Abstract 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 $n_1$ have links with bandwidth greater than the remaining $n-n_1$ nodes by $\gamma$ symbols, then the capacity increases by $\Omega(\gamma(k-n_1)^2)$ symbols compared to the static model.