CaltechAUTHORS
Published 2009 | Published
Book Section - Chapter Open

Distributed Storage Allocation Problems

Leong, Derek
Dimakis, Alexandros G.
Ho, Tracey
An error occurred while generating the citation.

Abstract

We investigate the problem of using several storage nodes to store a data object, subject to an aggregate storage budget or redundancy constraint. It is challenging to find the optimal allocation that maximizes the probability of successful recovery by the data collector because of the large space of possible symmetric and nonsymmetric allocations, and the nonconvexity of the problem. For the special case of probability-l recovery, we show that the optimal allocation that minimizes the required budget is symmetric. We further explore several storage allocation and access models, and determine the optimal symmetric allocation in the high-probability regime for a case of interest. Based on our experimental investigation, we make a general conjecture about a phase transition on the optimal allocation.

Additional Information

© 2009 IEEE. This material is based up on work under a subcontract #069153 issued by BAE Systems National Security Solutions, Inc. and supported by the Defense Advanced Research Projects Agency (DARPA) and the Space and Naval Warfare System Center (SPAWARSYSCEN), San Diego under Contract No. N66001-08-C-2013. We would like to thank Brighten Godfrey and Robert Kleinberg for introducing the problem to us and for sharing their insights on the optimality of nonsymmetric allocations. We also thank Dimitris Achlioptas for the interesting discussions.

Attached Files

Published - Leong2009p82812009_Workshop_On_Network_Coding_Theory_And_Applications.pdf

Files

Leong2009p82812009_Workshop_On_Network_Coding_Theory_And_Applications.pdf

Additional details

Identifiers Funding Dates
Created:
August 20, 2023
Modified:
October 20, 2023