CaltechAUTHORS
  A Caltech Library Service

Distributed Storage Allocations for Optimal Delay

Leong, Derek and Dimakis, Alexandros G. and Ho, Tracey (2011) Distributed Storage Allocations for Optimal Delay. In: 2011 IEEE International Symposium on Information Theory Proceedings. IEEE , Piscataway, NJ, pp. 1447-1451. ISBN 978-1-4577-0596-0. https://resolver.caltech.edu/CaltechAUTHORS:20120406-091523956

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20120406-091523956

Abstract

We examine the problem of creating an encoded distributed storage representation of a data object for a network of mobile storage nodes so as to achieve the optimal recovery delay. A source node creates a single data object and disseminates an encoded representation of it to other nodes for storage, subject to a given total storage budget. A data collector node subsequently attempts to recover the original data object by contacting other nodes and accessing the data stored in them. By using an appropriate code, successful recovery is achieved when the total amount of data accessed is at least the size of the original data object. The goal is to find an allocation of the given budget over the nodes that optimizes the recovery delay incurred by the data collector; two objectives are considered: (i) maximization of the probability of successful recovery by a given deadline, and (ii) minimization of the expected recovery delay. We solve the problem completely for the second objective in the case of symmetric allocations (in which all nonempty nodes store the same amount of data), and show that the optimal symmetric allocation for the two objectives can be quite different. A simple data dissemination and storage protocol for a mobile delay-tolerant network is evaluated under various scenarios via simulations. Our results show that the choice of storage allocation can have a significant impact on the recovery delay performance, and that coding may or may not be beneficial depending on the circumstances.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ISIT.2011.6033779DOIUNSPECIFIED
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6033779PublisherUNSPECIFIED
Additional Information:© 2011 IEEE. Date of Current Version: 03 October 2011. This work has been supported in part by the Air Force Office of Scientific Research under grant FA9550-10-1-0166 and Caltech’s Lee Center for Advanced Networking.
Funders:
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)FA9550-10-1-0166
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number12300094
Record Number:CaltechAUTHORS:20120406-091523956
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20120406-091523956
Official Citation:Leong, D.; Dimakis, A.G.; Ho, T.; , "Distributed storage allocations for optimal delay," Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , vol., no., pp.1447-1451, July 31 2011-Aug. 5 2011 doi: 10.1109/ISIT.2011.6033779 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6033779&isnumber=6033677
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:30000
Collection:CaltechAUTHORS
Deposited By: Ruth Sustaita
Deposited On:06 Apr 2012 16:33
Last Modified:03 Oct 2019 03:46

Repository Staff Only: item control page