Memory Allocation in Distributed Storage Networks
The authors consider the problem of distributing a file in a network of storage nodes whose storage budget is limited but at least equals the size file. They first generate T encoded symbols (from the file) which are then distributed among the nodes. They investigate the optimal allocation of T encoded packets to the storage nodes such that the probability of reconstructing the file by using any r out of n nodes is maximized. Since the optimal allocation of encoded packets is difficult to find in general, they find another objective function which well approximates the original problem and yet is easier to optimize.