Performance of random network coding for data dissemination
Name
62239163-MIT.pdf
Description
Full printable version
Size
608.25 KB
Format
Adobe PDF
Checksum (MD5)
23ecd44d24f5e920d2b2c75b9ade76f7
Author(s)
Choute, Clifford
Advisor(s)
Muriel Médard.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
Abstract
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..
Description
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
