Performance of random network coding for data dissemination
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/30369 |
| _version_ | 1811074643185893376 |
|---|---|
| author | Choute, Clifford |
| author2 | Muriel Médard. |
| author_facet | Muriel Médard. Choute, Clifford |
| author_sort | Choute, Clifford |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. |
| first_indexed | 2024-09-23T09:53:04Z |
| format | Thesis |
| id | mit-1721.1/30369 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:53:04Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/303692019-04-12T15:56:02Z Performance of random network coding for data dissemination Choute, Clifford Muriel Médard. 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 (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. 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. 43-44). Network coding is an alternative to traditional store-and-forward routing and is known to be necessary to achieve network capacity. It has also been shown randomized network coding is robust, and far outperforms store-and-forward for multicast. While much focus has been on the data rates achievable with coding, we focus on the time needed to broadcast a finite amount of data throughout networks using distributed randomized linear coding. We consider networks with increasingly complex graphs. We use analysis of the dissemination time using coding in the line network to discuss the performance of coding in networks with more complex topologies, such as the Manhattan grid network.. by Clifford Choute. M.Eng. 2006-03-21T21:09:07Z 2006-03-21T21:09:07Z 2005 2005 Thesis http://hdl.handle.net/1721.1/30369 62239163 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 44 p. 488386 bytes 622852 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Choute, Clifford Performance of random network coding for data dissemination |
| title | Performance of random network coding for data dissemination |
| title_full | Performance of random network coding for data dissemination |
| title_fullStr | Performance of random network coding for data dissemination |
| title_full_unstemmed | Performance of random network coding for data dissemination |
| title_short | Performance of random network coding for data dissemination |
| title_sort | performance of random network coding for data dissemination |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/30369 |
| work_keys_str_mv | AT chouteclifford performanceofrandomnetworkcodingfordatadissemination |