On the use of erasure codes in unreliable data networks
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33159 |
| _version_ | 1826198944118472704 |
|---|---|
| author | Parikh, Salil (Salil Arvind), 1971- |
| author2 | Vincent W.S. Chan. |
| author_facet | Vincent W.S. Chan. Parikh, Salil (Salil Arvind), 1971- |
| author_sort | Parikh, Salil (Salil Arvind), 1971- |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. |
| first_indexed | 2024-09-23T11:12:20Z |
| format | Thesis |
| id | mit-1721.1/33159 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:12:20Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/331592019-04-11T05:12:18Z On the use of erasure codes in unreliable data networks Parikh, Salil (Salil Arvind), 1971- Vincent W.S. Chan. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Includes bibliographical references (p. 62-64). Modern data networks are approaching the state where a large number of independent and heterogeneous paths are available between a source node and destination node. In this work, we explore the case where each path has an independent level of reliability characterized by a probability of path failure. Instead of simply repeating the message across all the paths, we use the path diversity to achieve reliable transmission of messages by using a coding technique known as an erasure correcting code. We develop a model of the network and present an analysis of the system that invokes the Central Limit Theorem to approximate the total number of bits received from all the paths. We then optimize the number of bits to send over each path in order to maximize the probability of receiving a sufficient number of bits at the destination to reconstruct the message using the erasure correcting code. Three cases are investigated: when the paths are very reliable, when the paths are very unreliable, and when the paths have a probability of failure within an interval surrounding 0.5. We present an overview of the mechanics of an erasure coding process applicable to packet-based transactions. Finally, as avenues for further research, we discuss several applications of erasure coding in networks that have only a single path between source and destination: for latency reduction in interactive web sessions; as a transport layer for critical messaging; and an application layer protocol for high-bandwidth networks. by Salil Parikh. S.M. 2006-06-20T12:51:50Z 2006-06-20T12:51:50Z 2001 2001 Thesis http://hdl.handle.net/1721.1/33159 49234455 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 64 p. 346500 bytes 346503 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Parikh, Salil (Salil Arvind), 1971- On the use of erasure codes in unreliable data networks |
| title | On the use of erasure codes in unreliable data networks |
| title_full | On the use of erasure codes in unreliable data networks |
| title_fullStr | On the use of erasure codes in unreliable data networks |
| title_full_unstemmed | On the use of erasure codes in unreliable data networks |
| title_short | On the use of erasure codes in unreliable data networks |
| title_sort | on the use of erasure codes in unreliable data networks |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/33159 |
| work_keys_str_mv | AT parikhsalilsalilarvind1971 ontheuseoferasurecodesinunreliabledatanetworks |