ACM Home Page
Please provide us with feedback. Feedback
A framework for lazy replication in P2P VoD
Full text PdfPdf (921 KB)
Source
International Workshop on Network and Operating System Support for Digital Audio and Video archive
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video table of contents
Braunschweig, Germany
SESSION: Streaming with P2P support table of contents
Pages 93-98  
Year of Publication: 2008
ISBN:978-1-60558-157-6
Authors
Bin Cheng  Huazhong University of Science and Technology
Lex Stein  Microsoft Research Asia
Hai Jin  Huazhong University of Science and Technology
Zheng Zhang  Microsoft Research Asia
Sponsors
: Technische Universität Braunschweig
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
: Simula Research Laboratory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 59,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1496046.1496068
What is a DOI?

ABSTRACT

Video-on-Demand (VoD) is a compelling application, but costly due to the load it places on servers. Peer-to-peer (P2P) techniques hold the potential to reduce centralized costs by sharing data between peers. There are many difficult design issues associated with P2P for VoD. Viewing the problem as designing a large distributed cache, many of the issues can be expressed in terms of caching algorithms.

In an earlier paper [6], we studied the performance of Grid-Cast, a P2P VoD system deployed on CERNET. From system traces, we found that departure misses are the major cause of server load. Motivated by this finding, this paper examines how to use replication to decrease departure misses and thereby further reduce server load.

This paper proposes and evaluates a framework for lazy replication. Lazy replication postpones replication, trying to make efficient use of bandwidth. In our framework, two predictors are plugged in to create the working replication algorithm. Lazy replication with several predictors is compared with a naïve eager replication algorithm. We find that lazy replication is more efficient than eager replication, even when using two simple predictors. With these two simple predictors, lazy replication can decrease server load by 15% from multivideo caching with only a minor increase in network traffic.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
B. Cheng, H. Jin, and X. Liao. Supporting VCR Functions in P2P VoD Services Using Ring-Assisted Overlays. In Proc. of ICC, 2007.
 
5
B. Cheng, X. Liu, Z. Zhang, and H. Jin. A Measurement Study of a Peer-to-Peer Video-on-Demand System. In the 6th International Workshop on Peer-to-Peer Systems, 2007.
6
7
8
 
9
J. Tian and Y. Dai. Understanding the Dynamic of Peer-to-Peer Systems. In IPTPS, 2007.
10
11

Collaborative Colleagues:
Bin Cheng: colleagues
Lex Stein: colleagues
Hai Jin: colleagues
Zheng Zhang: colleagues