On replication algorithm in P2P VoD

Authors:
Yipeng Zhou;Tom Z. J. Fu;Dah Ming Chiu
Affiliations:
Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 8
Cited 0

Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Load management in distributed video servers

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
ECHOS: edge capacity hosting overlays of nano data centers

ACM SIGCOMM Computer Communication Review
Challenges, design and analysis of a large-scale p2p-vod system

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Analytical Model for Mesh-Based P2PVoD

ISM '08 Proceedings of the 2008 Tenth IEEE International Symposium on Multimedia
Incorporating random linear network coding for peer-to-peer network diagnosis

INFOCOM'10 Proceedings of the 29th conference on Information communications
Content distribution in heterogenous video-on-demand p2p networks with ARIMA forecasts

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Push-to-Peer Video-on-Demand System: Design and Evaluation

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional video-on-demand (VoD) systems rely purely on servers to stream video content to clients, which does not scale. In recent years, peer-to-peer assisted VoD (P2P VoD) has proven to be practical and effective. In P2P VoD, each peer contributes some storage to store videos (or segments of videos) to help the video server. Assuming peers have sufficient bandwidth for the given video playback rate, a fundamental question is what is the relationship between the storage capacity (at each peer), the number of videos, the number of peers, and the resultant off-loading of video server bandwidth. In this paper, we use a simple statistical model to derive this relationship. We propose and analyze a generic replication algorithm Random with Load Balancing (RLB) that balances the service to all movies for both deterministic and random (but stationary) demand models and both homogeneous and heterogeneous peers (in upload bandwidth). We use simulation to validate our results for sensitivity analysis and for comparisons to other popular replication algorithms. This study leads to several fundamental insights for P2P VoD system design in practice.