Derek Leong

  1. Distributed Storage Allocations for Optimal Delay.

    Authors: Alexandros G. Dimakis, Tracey Ho, Derek Leong
    Subjects: Information Theory
    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.

  2. Symmetric Allocations for Distributed Storage.

    Authors: Alexandros G. Dimakis, Tracey Ho, Derek Leong
    Subjects: Information Theory
    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
    coded data in each node, as long as the total amount of storage used does not
    exceed the given budget. A data collector subsequently attempts to recover the
    original data object by accessing each of the nodes independently with some
    constant probability.

Syndicate content