Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent
research attention, but also been implemented and deployed with success in large-scale real-world streaming systems. Despite the remarkable popularity in real-world systems, the design of such systems are not well understood. In this thesis, we seek to address two design problems in peer-assisted VoD systems. First, we focus on the design of cache replacement algorithms. We construct an analytical framework based on dynamic
programming, to help us form an in-depth understanding of optimal strategies to design
cache replacement algorithms. Second, we shift our attention to the surplus upload
bandwidth allocation problem in multi-channel systems. Through theoretical analysis
and realistic simulations, we conclude that surplus upload bandwidth from peers can be
utilized more efficiently than conventional prefetching strategies when it is devoted to
redistributing content to those channels in deficit state.
| Identifer | oai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/19002 |
| Date | 17 February 2010 |
| Creators | Wu, Jiahua |
| Contributors | Li, Baochun |
| Source Sets | University of Toronto |
| Language | en_ca |
| Detected Language | English |
| Type | Thesis |
Page generated in 0.002 seconds