On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic

被引:27
作者
Hefeeda, Mohamed [1 ]
Noorizadeh, Behrooz [2 ]
机构
[1] Simon Fraser Univ, Sch Comp Sci, Surrey, BC V3T 0A3, Canada
[2] Nokia, Vancouver, BC V5J 5J8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Peer-to-peer systems; caching; cooperative caching; traffic modeling;
D O I
10.1109/TPDS.2009.130
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet Service Providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASs), while the second considers cooperation among caches deployed within the same AS. We analyze the potential gain of cooperative caching in these two models. To perform this analysis, we conduct an eight-month measurement study on a popular P2P system to collect traffic traces for multiple caches. Then, we perform extensive trace-based simulations to analyze different angles of cooperative caching schemes. Our results demonstrate that: 1) significant improvement in byte hit rate can be achieved using cooperative caching, 2) simple object replacement policies are sufficient to achieve that gain, and 3) the overhead imposed by cooperative caching is negligible. In addition, we develop an analytic model to assess the gain from cooperative caching in different settings. The model accounts for number of caches, salient P2P traffic features, and network characteristics. Our model confirms that substantial gains from cooperative caching are attainable under wide ranges of traffic and network characteristics.
引用
收藏
页码:998 / 1010
页数:13
相关论文
共 27 条
[1]  
[Anonymous], 1997, Complex Systems, DOI DOI 13/2018/02/11-6-4.PDF
[2]  
[Anonymous], 2186 RFC
[3]  
[Anonymous], P INT WORKSH WEB CON
[4]  
BINDAL R, 2006, P IEEE INT C DISTR C, P1
[5]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
[6]   AS relationships: Inference and validation [J].
Dimitropoulos, Xenofontas ;
Krioukov, Dmitri ;
Fomenkov, Marina ;
Huffaker, Bradley ;
Hyun, Young ;
Claffy, K.C. ;
Riley, George .
Computer Communication Review, 2007, 37 (01) :29-40
[7]   Limitations and benefits of cooperative proxy caching [J].
Dykes, SG ;
Robbins, KA .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20 (07) :1290-1304
[8]   Reduce, reuse, recycle: An approach to building large Internet caches [J].
Gadde, S ;
Rabinovich, M ;
Chase, J .
SIXTH WORKSHOP ON HOT TOPICS IN OPERATING SYSTEMS, PROCEEDINGS, 1997, :93-98
[9]  
GADDE S, 1998, P WORKSH INT SERV PE
[10]  
GUMMADI KP, 2003, P 19 ACM S OP SYST P, P314