2026-09-19T01:03:13Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/303692022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Muriel Médard.
Choute, Clifford
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-03-21T21:09:07Z
2006-03-21T21:09:07Z
2005
2005
http://hdl.handle.net/1721.1/30369
62239163
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.
44 p.
488386 bytes
622852 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
Performance of random network coding for data dissemination
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="349968a8-8fb7-4d2a-a7a3-4a399fa2f79f">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Performance of random network coding for data dissemination</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Choute, Clifford</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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..</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>