Combined Thesis Feed
https://feeds.library.caltech.edu/people/Leong-Derek/combined_thesis.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenWed, 07 Feb 2024 04:15:10 +0000On Erasure Coding for Distributed Storage and Streaming Communications
https://resolver.caltech.edu/CaltechTHESIS:05312013-162820930
Authors: {'items': [{'email': 'leong.derek@gmail.com', 'id': 'Leong-Derek', 'name': {'family': 'Leong', 'given': 'Derek'}, 'show_email': 'NO'}]}
Year: 2013
DOI: 10.7907/PZJ8-F333
<p>The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.</p>
<p>First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability.
The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes.
This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation.
We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases.
Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small.
Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.</p>
<p>Second, we study how distributed storage allocations affect the recovery delay in a mobile setting.
Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes:
the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay.
We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations.
It turns out that the optimal allocations for the two problems can be quite different.
In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.</p>
<p>Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link;
the receiver must subsequently decode each message within a given delay from its creation time.
For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns.
For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases.
We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability;
the objective is to maximize the decoding probability for a given message size.
We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small.
In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.</p>
<p>Finally, we consider the joint problems of routing and caching for named data networking.
We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions.
In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.</p>https://thesis.library.caltech.edu/id/eprint/7806