Distributed caching in unstructured peer-to-peer file sharing networks

被引:4
作者
Gao, Guoqiang [1 ,2 ]
Li, Ruixuan [1 ]
He, Heng [1 ]
Xu, Zhiyong [3 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
[2] Wuhan Text Univ, Sch Media & Commun, Wuhan, Peoples R China
[3] Suffolk Univ, Dept Math & Comp Sci, Boston, MA 02114 USA
基金
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词
D O I
10.1016/j.compeleceng.2013.12.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, the peer-to-peer (P2P) system is one of the largest Internet bandwidth consumers. To relieve the burden on Internet backbone and improve the query and retrieve performance of P2P file sharing networks, efficient P2P caching algorithms are of great importance. In this paper, we propose a distributed topology-aware unstructured P2P file caching infrastructure and design novel placement and replacement algorithms to achieve optimal performance. In our system, for each file, an adequate number of copies are generated and disseminated at topologically distant locations. Unlike general believes, our caching decisions are in favor of less popular files. Combined with the underlying topology-aware infrastructure, our strategy retains excellent performance for popular objects while greatly improves the caching performance for less popular files. Overall, our solution can reduce P2P traffic on Internet backbone, and relieve the over-caching problem that has not been properly addressed in unstructured P2P networks. We carry out simulation experiments to compare our approaches with several traditional caching strategies. The results show that our algorithms can achieve better query hit rates, smaller query delay, higher cache hit rates, and lower communication overhead. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:688 / 703
页数:16
相关论文
共 32 条
[1]  
[Anonymous], PEERSIM SIMULATOR
[2]  
[Anonymous], 1999, ACM SIGCOMM COMP COM
[3]  
Backx P, 2002, P EUR 2002 POW NETW, P1
[4]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[5]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
[6]  
Busari M, 2001, IEEE INFOCOM SER, P1225, DOI 10.1109/INFCOM.2001.916617
[7]   Probabilistic file indexing and searching in unstructured peer-to-peer networks [J].
Cheng, AH ;
Joung, YJ .
COMPUTER NETWORKS, 2006, 50 (01) :106-127
[8]  
Cisco Inc, 2009, CISC VIS NETW IND FO, P2009
[9]  
Clarke I., 2000, Workshop on Design Issues in Anonymity and, Unobservability, P311
[10]  
Frey D., 2010, PEER TO PEER COMPUTI, P1