On Distributed Storage Allocations of Large Files for Maximum Service Rate (1808.07545v1)

Abstract: Allocation of (redundant) file chunks throughout a distributed storage system affects important performance metrics such as the probability of file recovery, data download time, or the service rate of the system under a given data access model. This paper is concerned with the service rate under the assumption that the stored data is large and its download time is not negligible. We focus on quasi-uniform storage allocations and provide a service rate analysis for two common data access models. We find that the optimal allocation varies in accordance with different system parameters. This was not the case under the assumption that the download time does not scale with the size of data, where the minimal spreading allocation was previously found to be universally optimal.