Server-assisted adaptive video replication for P2P VoD
Author(s)
Author(s)
Zhou, Y.
Fu, T. Z. J.
Date Issued
2012
Publisher
Elsevier
Journal
Signal Processing: Image Communication
Volume
27
Issue
5
Start page
484
End page
495
Abstract
In recent years, Peer-to-Peer assisted Video-on-Demand (P2P VoD) has become an effective and efficient approach to distribute high-quality videos to large number of peers. In a P2P VoD system, each peer contributes storage to store several videos to help offload the server. The replication strategy, which determines the videos to be stored at each peer's local storage, plays an important role in system performance. There are two approaches: (a) solve a huge combinatorial optimization problem and (b) use simple cache replacement algorithms, such as Least-Frequently-Requested (LFR) or FIFO. The first approach needs to collect a large number of parameters whose values may be changing, and use some approximation method (such as linearization) to solve the optimization problem, both aspects have accuracy issues. In the second approach, a peer replaces some video in the cache with the currently viewed video, based on local information. While it is simple, we show their performance can be improved by a little centrally collected state information. Specifically, the needed feedback information is the current downloading rate provided by peers for each video. In this paper, we describe a hybrid replication strategy, and give detailed description of how the server collects and maintains the feedback information, and how peers use that information to determine what videos to store and indirectly control their uplink bandwidth contribution. This explains why the hybrid strategy is much simpler and more practical than the combinatory optimization approach. We then use simulation to demonstrate how our scheme out-performs the simple adaptive algorithms. Our simulation results also demonstrate how our scheme is able to quickly respond to peer churn and video popularity churn.
SFU Affiliated Publication
No
Availability at SFU Library
No database links found.