The Community for Technology Leaders
Green Image
Issue No. 09 - September (2010 vol. 21)
ISSN: 1045-9219
pp: 1354-1367
Chao Liang , Polytechnic Institute of NYU, Brooklyn
Zhenghua Fu , IBM T.J.Watson Research Center, Hawthorne
Yong Liu , Polytechnic Institute of NYU, Brooklyn
Chai Wah Wu , IBM T.J.Watson Research Center, Hawthorne
As an efficient distribution mechanism, Peer-to-Peer (P2P) technology has become a tremendously attractive solution to offload servers in large-scale video streaming applications. However, in providing on-demand asynchronous streaming services, P2P streaming design faces two major challenges: how to schedule efficient video sharing between peers with asynchronous playback progresses? how to provide incentives for peers to contribute their resources to achieve a high level of system-wide Quality-of-Experience (QoE)? In this paper, we present iPASS, a novel mesh-based P2P VoD system, to address these challenges. Specifically, iPASS adopts a dynamic buffering-progress-based peering strategy to achieve high peer bandwidth utilization with low system maintenance cost. To provide incentives for peer uploading, iPASS employs a differentiated prefetching design that enables peers with higher contribution prefetch content at higher speed. A distributed adaptive taxation algorithm is developed to balance the system-wide QoE and service differentiations among heterogeneous peers. To assess the performance of iPASS, we built a detailed packet-level P2P VoD simulator and conducted extensive simulations. It was demonstrated that iPASS can completely offload server when the average peer upload bandwidth is more than 1.2 times the streaming rate. Furthermore, we showed that the distributed incentive algorithm motivates peers to contribute and collaboratively achieve a high level of system wide QoE.
Peer-to-peer, video streaming, on-demand, incentive.

C. Liang, C. W. Wu, Y. Liu and Z. Fu, "Incentivized Peer-Assisted Streaming for On-Demand Services," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1354-1367, 2009.
87 ms
(Ver 3.3 (11022016))