Show simple item record

dc.contributor.advisorEager, Derek L.en_US
dc.creatorZhu, Qingen_US
dc.date.accessioned2007-04-30T17:41:37Zen_US
dc.date.accessioned2013-01-04T04:30:12Z
dc.date.available2007-05-02T08:00:00Zen_US
dc.date.available2013-01-04T04:30:12Z
dc.date.created2007-05en_US
dc.date.issued2007-05-02en_US
dc.date.submittedMay 2007en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-04302007-174137en_US
dc.description.abstractIn recent years, with the fast development of resource capability of both the Internet and personal computers, multimedia applications like video-on-demand (VOD) streaming have gained dramatic growth and been shown to be potential killer applications in the current and next-generation Internet. Scalable deployment of these applications has become a hot problem area due to the potentially high server and network bandwidth required in these systems.The conventional approach in a VOD streaming system dedicates a media stream for each client request, which is not scalable in a wide-area delivery system serving potentially very large numbers of clients. Recently, various efficient delivery techniques have been proposed to improve the scalability of VOD delivery systems. One approach is to use a scalable delivery protocol based on multicast, such as periodic broadcast or stream merging. These protocols have been mostly developed for single-server based systems and attempt to have each media stream serve as many clients as possible, so as to minimize the required server and network bandwidth. However, the performance improvements possible with techniques that deliver all streams from a single server are limited, especially regarding the required network bandwidth. Another approach is based on proxy caching and content replication, such as in content delivery networks (CDN). Although this approach is able to effectively distribute load across multiple CDN servers, the cost of this approach may be high.With the focus on further improving the system efficiency regarding the server and network bandwidth requirement, a new scalable streaming protocol is developed in this work. It adapts a previously proposed technique called hierarchical multicast stream merging (HMSM) to use a peer-to-peer delivery approach. To be more efficient in media delivery, the conventional early merging policy associated with HMSM is extended to be compatible with the peer-to-peer environment, and various peer selection policies are designed for initiation of media streams. The impact of limited peer resource capability is also studied in this work. In the performance study, a number of simulation experiments are conducted to evaluate the performance of the new protocol and various design policies, and promising results are reported.en_US
dc.language.isoen_USen_US
dc.subjectPerformanceen_US
dc.subjectMulticasten_US
dc.subjectPeer-to-peeren_US
dc.subjectVideo-on-demanden_US
dc.titlePeer-to-peer stream merging for stored multimediaen_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Science (M.Sc.)en_US
dc.type.materialtexten_US
dc.type.genreThesisen_US
dc.contributor.committeeMemberMakaroff, Dwighten_US
dc.contributor.committeeMemberKo, Seok-Bumen_US
dc.contributor.committeeMemberKeil, J. Marken_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record