On replication algorithm in P2P VoD

Yipeng Zhou, Tom Z. J. Fu, Dah Ming Chiu

Research output: Contribution to journalArticle

29 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)233-243
Number of pages11
JournalIEEE/ACM Transactions on Networking
Volume21
Issue number1
DOIs
Publication statusPublished - 2013
Externally publishedYes

Keywords

  • Peer-to-peer assisted video-on-demand (P2P VoD)
  • replication
  • scheduling
  • stationary

Fingerprint Dive into the research topics of 'On replication algorithm in P2P VoD'. Together they form a unique fingerprint.

Cite this