A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing Systems

In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although it would cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of level-1 cache and level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so that it could manage both of static and dynamic data in a space-efficient manner, where static data indicates popular pages which are frequently requested by many users and dynamic data indicates pages which may not be popular but repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces the network traffic and exhibits a high hit rate even in small cache sizes.

[1]  Rakesh Kumar,et al.  The FastTrack overlay: A measurement study , 2006, Comput. Networks.

[2]  Mohamed Hefeeda,et al.  Modeling and Caching of Peer-to-Peer Traffic , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[3]  I. Good.  THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS , 1953 .

[4]  Hans Friedrich Witschel,et al.  Admission Policies for Caches of Search Engine Results , 2007, SPIRE.

[5]  Jiangchuan Liu,et al.  Proxy caching for media streaming over the Internet , 2004, IEEE Communications Magazine.

[6]  Amanda Spink,et al.  Real life, real users, and real needs: a study and analysis of user queries on the web , 2000, Inf. Process. Manag..

[7]  Fabrizio Silvestri,et al.  Boosting the performance of Web search engines: Caching and prefetching query results by exploiting historical usage data , 2006, TOIS.

[8]  Adam Wierzbicki,et al.  Cache replacement policies revisited: the case of P2P traffic , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[9]  Satoshi Fujita,et al.  A Hierarchical Architecture for Real-Time Search in Peer-to-Peer Networks , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[10]  Evangelos P. Markatos,et al.  On caching search engine query results , 2001, Comput. Commun..

[11]  Shlomo Moran,et al.  Predictive caching and prefetching of query results in search engines , 2003, WWW '03.

[12]  Evangelos P. Markatos,et al.  Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[13]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Azer Bestavros,et al.  Popularity-aware greedy dual-size Web proxy caching algorithms , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[15]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[16]  Mohamed Hefeeda,et al.  Traffic modeling and proportional partial caching for peer-to-peer systems , 2008, TNET.

[17]  Dick H. J. Epema,et al.  The Design and Evaluation of a Self-Organizing Superpeer Network , 2010, IEEE Transactions on Computers.

[18]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[19]  Wagner Meira,et al.  Rank-preserving two-level caching for scalable search engines , 2001, SIGIR '01.

[20]  Craig Silverstein,et al.  Analysis of a Very Large Altavista Query Log" SRC Technical note #1998-14 , 1998 .

[21]  Satoshi Fujita,et al.  Quick Forwarding of Queries to Relevant Peers in a Hierarchical P2P File Search System , 2010, ICA3PP.