Optimising upload bandwidth for quality of VCR operations in P2P VoD systems

Authors:
Tzu-Meng Chung;Shih-Chieh Huang;Chung-Ta King;Chiu-Ping Chang
Affiliations:
Department of Computer Science, National Tsing Hua University, Kuang-Fu Road, Hsinchu 30013, Taiwan.;Department of Computer Science, National Tsing Hua University, Kuang-Fu Road, Hsinchu 30013, Taiwan.;Department of Computer Science, National Tsing Hua University, Kuang-Fu Road, Hsinchu 30013, Taiwan.;Department of Computer Science, National Tsing Hua University, Kuang-Fu Road, Hsinchu 30013, Taiwan
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2010

Citing 6
Cited 0

Patching: a multicast technique for true video-on-demand services

MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
P2Cast: peer-to-peer patching scheme for VoD service

WWW '03 Proceedings of the 12th international conference on World Wide Web
Chaining: A Generalized Batching Technique for Video-On-Demand Systems

ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
OBN: Peering for Finding Suppliers in P2P On-demand Streaming Systems

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Enabling DVD-like features in P2P video-on-demand systems

Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many P2P VoD systems have been proposed, but only few can support VCR operations. Most of the works require very well provisioned source servers to guarantee the quality. The challenge is to do the same without requiring well provisioned source servers. In this paper, we take the heterogeneity of bandwidth into consideration, and also consider the practical case in which the capacity of the streaming buffer is limited. With these conditions, we formulate the problem as an upload bandwidth optimisation problem. We first prove that this problem is NP-hard and then propose an optimal dynamic programming solution.