Capacity of dynamical storage systems

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 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.