Performance of random network coding for data dissemination
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
MetadataShow full item record
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..
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).
DepartmentMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology
Electrical Engineering and Computer Science.