This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
October 2006 (vol. 17 no. 10)
pp. 1097-1109
Chen Wang, IEEE
Li Xiao, IEEE
Yunhao Liu, IEEE
Pei Zheng, IEEE

Abstract—Peer-to-peer networks are widely criticized for their inefficient flooding search mechanism. Distributed Hash Table (DHT) algorithms have been proposed to improve the search efficiency by mapping the index of a file to a unique peer based on predefined hash functions. However, the tight coupling between indices and hosting peers incurs high maintenance cost in a highly dynamic network. To properly balance the tradeoff between the costs of indexing and searching, we propose the distributed caching and adaptive search (DiCAS) algorithm, where indices are passively cached in a group of peers based on a predefined hash function. Guided by the same function, adaptive search selectively forwards queries to "matched” peers with a high probability of caching the desired indices. The search cost is reduced due to shrunk searching space. Different from the DHT solutions, distributed caching loosely maps the index of a file to a group of peers in a passive fashion, which saves the cost of updating indices. Our simulation study shows that the DiCAS protocol can significantly reduce the network search traffic with the help of small cache space contributed by each individual peer.

[1] Gnutella Network Size, http://www.limewire.com/index.jspsize, 2003.
[2] The Gnutella Protocol Specification 0.6, 2002, http:/rfc-gnutella. sourceforge.net.
[3] Limewire, http:/www.limewire.com, 2003.
[4] V. Almeida, A. Bestavros, M. Crovella, and A.d. Olivera, “Characterizing Reference Locality in the WWW,” Proc. IEEE Conf. Parallel and Distributed Information Systems (PDIS), 1996.
[5] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. INFOCOM, 1999.
[6] BRITE, http://www.cs.bu.edubrite/, 2003.
[7] B.F. Cooper and H. Garcia-Molina, “Studying Search Networks with SIL,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.
[8] A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. 28th Conf. Distributed Computing Systems, 2002.
[9] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. SIGCOMM, 1999.
[10] B.J. Jansen, A. Spink, J. Bateman, and T. Saracevic, “Real Life Information Retrieval: A Study of User Queries on the Web,” Proc. SIGIR Forum, vol. 32, no. 1, pp. 5-17, 1998.
[11] S. Joseph, “NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks,” Proc. Int'l Workshop Peer-to-Peer Computing (colocated with Networking 2002), 2002.
[12] C. Lindemann and O.P. Waldhorst, “A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications,” Proc. Int'l Workshop Peer-to-Peer Computing, 2002.
[13] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th ACM Int'l Conf. Supercomputing, 2002.
[14] E.P. Markatos, “Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella,” Proc. Second IEEE/ACM Int'l Symp. Cluster Computing and the Grid, 2002.
[15] D.A. Menasce and L. Kanchanapalli, “Probabilistic Scalable P2P Resource Location Services,” Proc. ACM SIGMETRICS Performance Evaluation Rev., vol. 30, no. 2, pp. 48-58, 2002.
[16] C.R. Palmer and J.G. Steffan, “Generating Network Topologies that Obey Power Laws,” Proc. IEEE Globecom, 2000.
[17] S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks,” Proc. 17th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2003.
[18] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, 2001.
[19] M. Ripeanu, A. Iamnitchi, and I. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, 2002.
[20] J. Ritter, “Why Gnutella Can't Scale, No, Really,” http://www.tch.orggnutella.html, 2001.
[21] “Controlled Update Propagation in Peer-to-Peer Networks,” Proc. 2003 USENIX Ann. Technical Conf., M. Roussopoulos and M. Baker, eds., 2003.
[22] M. Roussopoulos and M. Baker, “Practical Load Balancing for Content Requests in Peer-to-Peer Networks,” Technical Report cs.NI/0209023, Stanford Univ., 2003.
[23] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. Int'l Conf. Distributed Systems Platforms, 2001.
[24] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN), 2002.
[25] S. Saroiu, K.P. Gummadi, R.J. Dunn, S.D. Gribble, and H.M. Levy, “An Analysis of Internet Content Delivery Systems,” Proc. Fifth Symp. Operating Systems Design and Implementation, 2002.
[26] M.T. Schlosser and S.D. Kamvar, “Availability and Locality Measurements of Peer-to-Peer File Systems,” Proc. ITCom Conf.: Scalability and Traffic Control in IP Networks, 2002.
[27] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” Proc. ACM SIGCOMM Internet Measurement Workshop, 2002.
[28] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” http://www2.cs.cmu.edu/kunwadee/research/ p2pgnutella.html, 2001.
[29] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. INFOCOM, 2003.
[30] R.M. Stoica, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[31] Y. Xie and D. O'Hallaron, “Locality in Search Engine Queries and Its Implications for Caching,” Proc. INFOCOM, 2002.
[32] B. Yang and H. Garcia-Molina, “Efficient Search in Peer-to-Peer Networks,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[33] Y.B. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing,” Technical Report UCB//CSD-01-1141, Univ. of Calif. Berkeley, 2001.

Index Terms:
Peer-to-peer, query response, flooding, distributed caching and adaptive search, search efficiency.
Citation:
Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng, "DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 10, pp. 1097-1109, Oct. 2006, doi:10.1109/TPDS.2006.137
Usage of this product signifies your acceptance of the Terms of Use.