Distributed Storage Allocation for High Reliability
Authors:
- D. LeongDLD. Leong
- A. G. DimakisADA. G. Dimakis
- T. HoTHT. Ho
- 1 May 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of storage nodes; it is allowed to store any amount of data in each storage node, subject to a given total storage budget constraint. A data collector subsequently attempts to recover the original data object by accessing a random fixed-size subset of these storage nodes. Successful recovery of the data object occurs when the total amount of coded data in this subset of storage nodes is at least the size of the original data object. The goal is to determine the amount of data to store in each storage node so that the probability of successful recovery is maximized. We solve this problem in the high recovery probability regime. Our results can be applied to a variety of distributed storage systems, including delay tolerant networks (DTNs), content delivery networks (CDNs), and sensor networks.Keywords
This publication has 10 references indexed in Scilit:
- Distributed storage allocation problems2009
- Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks2008
- Network Coding for Distributed Storage Systems2007
- Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes2007
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Growth codes2006
- Network Coding for Joint Storage and Transmission with Minimum Cost2006
- Network codingACM SIGCOMM Computer Communication Review, 2006
- Using redundancy to cope with failures in a delay tolerant network2005
- Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes2005