Donahoo, Michael J.Cutchin, Andrew E.Baylor University. Dept. of Computer Science.2008-04-152017-04-072008-04-152017-04-0720072008-04-15http://hdl.handle.net/2104/5140Includes bibliographic references (p. 93-94).Many critical network applications require the transmission of bulk data to a large, heterogeneous, asynchronous receiver set. Standard unicast solutions exhibit poor scaling due to inefficient use of bandwidth over shared links, prompting consideration of multicast and peer-to-peer systems. Unfortunately, these approaches introduce their own problems. In multicast, we must provide transport layer services, such as reliability and congestion/flow control. To deal with these, researchers have proposed the use of several layered multicast scheduling techniques using cyclic transmission and FEC. For peer-to-peer systems, we must address the problem of block location and extinction. Work in network coding provides an elegant solution to these problems; however, a naive implementation of such coding is computationally expensive. We propose a practical implementation of network coding. Next we compare several layered encoding schemes. Finally, we compare the performance of layered multicast and network coding in peer-to-peer systems.xi, 94 p. : ill.157832 bytes817068 bytesapplication/pdfapplication/pdfen-USBaylor University 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. Contact librarywebmaster@baylor.edu for inquiries about permission.Multicasting (Computer networks).Peer-to-peer architecture (Computer networks).Data transmission systems.ThesisWorldwide access