GridCast: Improving Peer Sharing for P2P VoD

被引:15
作者
Cheng, Bin [1 ]
Stein, Lex [2 ]
Jin, Hai [1 ]
Liao, Xiaofei [1 ]
Zhang, Zheng [2 ]
机构
[1] Huazhong Univ Sci & Technol, Serv Comp Technol & Syst Lab, Wuhan 430074, Peoples R China
[2] Microsoft Res Asia, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Design; Measurement; Performance; Video-on-demand; peer-to-peer; caching; replication;
D O I
10.1145/1412196.1412199
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Video-on-Demand (VoD) is a compelling application, but costly. VoD is costly due to the load it places on video source servers. Many have proposed using peer-to-peer (P2P) techniques to shift load from servers to peers. Yet, nobody has implemented and deployed a system to openly and systematically evaluate how these techniques work. This article describes the design, implementation and evaluation of GridCast, a real deployed P2P VoD system. GridCast has been live on CERNET since May of 2006. It provides seek, pause, and play operations, and employs peer sharing to improve system scalability. In peak months, GridCast has served videos to 23,000 unique users. From the first deployment, we have gathered information to understand the system and evaluate how to further improve peer sharing through caching and replication. We first show that GridCast with single video caching (SVC) can decrease load on source servers by an average of 22% from a client-server architecture. We analyze the net effect on system resources and determine that peer upload is largely idle. This leads us to changing the caching algorithm to cache multiple videos (MVC). MVC decreases source load by an average of 51% over the client-server. The improvement is greater as user load increases. This bodes well for peer-assistance at larger scales. A detailed analysis of MVC shows that departure misses become a major issue in a P2P VoD system with caching optimization. Motivated by this observation, we examine how to use replication to eliminate departure misses and further reduce server load. A framework for lazy replication is presented and evaluated in this article. In this framework, two predictors are plugged in to create the working replication algorithm. With these two simple predictors, lazy replication can decrease server load by 15% from MVC with only a minor increase in network traffic.
引用
收藏
页数:31
相关论文
共 25 条
  • [1] Annapureddy S, 2007, P INT WORLD WID WEB
  • [2] [Anonymous], 2007, JOOST MEASUREMENT ST
  • [3] [Anonymous], 2006, 4566 RFC
  • [4] *CERNET, 2006, CHIN ED RES NETW ANN
  • [5] CHENG B, 2007, P IEEE INT C COMM
  • [6] CHENG B, 2008, P EUR PROF SOC COMP
  • [7] CHU YH, 2000, P ACM SIGMETRICS JOI
  • [8] COHEN B., 2003, P WORKSH EC PEER TO
  • [9] CUI L, 2004, IEEE J SELECT AREA C
  • [10] GUO L, 2005, P INT MARK C