Can internet video-on-demand be profitable?
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
TRIBLER: a social-based peer-to-peer system: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
On ISP-friendly rate allocation for peer-assisted VoD
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Improving BitTorrent Network's Performance via Deploying Helpers
EUC '08 Proceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 02
A reliable decentralized peer-to-peer video-on-demand system using helpers
PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
Scaling peer-to-peer video-on-demand systems using helpers
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Hi-index | 0.00 |
Peer-to-peer (P2P) content distribution effectively solves the problem of large-scale streaming media delivery. But the performance of a P2P system is primarily bottlenecked, because the upload bandwidth of the participating peers is limited. Using helpers in the P2P system utilizes upload bandwidth of those idle peers uninterested in the delivered content, which further improves the performance of P2P systems, and the feasibility and validity have been testified [1]. Aiming at the p2p video-on-demand system, this thesis designs a novel grouping algorithm of helpers. In order to make more rational and effective use of helpers, the algorithm divides the helpers into different groups according to the number of each video's users, thus reducing the average view delay of whole system and improving the utilization rate of the helpers, reinforcing watch experience for users of the system. Analysis and simulation results corroborate the effectiveness of the proposed algorithm in the paper.