Distributed Storage Allocations for Optimal Delay

The authors 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.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Jun 2011 Format: PDF

Find By Topic