Evaluation study of a distributed caching based on query similarity in a P2P network
Article No.: 26, Pages 1 - 7
Abstract
Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnecessary traffic in the Hybrid Overlay Network (HON), which consists in organizing peers and data in an n-dimensional feature space for efficient similarity search. We propose a distributed caching schema that group similar queries to increase the success hit and avoid redundancy. We show through extensive simulations that caching in HON decreases significantly the query scope improving search performance.
References
[1]
L. A. Adamic, R. Lukose, A. Puniyani, and B. Huberman, "Search in power law networks," vol. 64, no. E, pp. 46 135--46 143, 2001.
[2]
A. Chankhunthod, P. Danzig, C. Neerdaels, M. Schwartz, and K. Worrell, "Hierarchical internet object cache," In Proceedings of the USENIX Technical Conference, 1996.
[3]
E. Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," In Proceedings of the 2002 conference on Applications, Technologies, Architectures and protocols for computer communications, pp. 177--190, 2002.
[4]
L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary cache: a scalable wide-area web cache sharing protocol," IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281--293, 2000.
[5]
Gnutella, "http://www.gnutella.com," 2003.
[6]
M. Kacimi and K. Yetongnon, "Density-based clustering for similarity search in a p2p network," In proceedings of the 6th IEEE Symposium on Cluster Computing and the Grid, 2006.
[7]
M. Kacimi, K. Yetongnon, Y. Ma, and R. Chbeir, "Distributed caching in a cluster-based hybrid overlay network for p2p systems," In the proceedings of the 18th International Conference on Parallel and Distributed Computing Systems, 2005.
[8]
KAZZA, "http://www.kazaa.com/," 2002.
[9]
D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," In Proceedings of the 21st annual ACM symposium, pp. 183--192, 2002.
[10]
E. P. Markatos, "Tracing a large-scale peer to peer system: An hour in the life of gnutella," In Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02), p. 65, 2002.
[11]
S. Patro and Y. C. Hu, "Transparent query caching in peer-to-peer overlay networks," International Parallel and Distributed Processing Symposium (IPDPD'03), no. 32, 2003.
[12]
S. Paul and Z. Fei, "Distributed caching with centralized control," Computer Communications journal, vol. 24, no. 2, pp. 256--268, 2001.
[13]
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," In Proceedings of ACM SIGCOMM, 2001.
[14]
K. Sripanidkulchai, "The popularity of gnutella queries and its implications on scalability," Carnegie Mellon University, Tech. Rep., Jan 2004.
[15]
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," ACM SIGCOMM, pp. 149--160, 2001.
[16]
C. Wang, L. Xiao, Y. Liu, and P. Zheng, "Distributed caching and adaptive search in multilayer p2p networks," In Proceedings of the 24th International Conference on Distributed Computing Systems (IDCS'04), 2004.
[17]
S. Wang, L. Xiao, Y. Liu, and P. Zheng, "Dicas: An efficient distributed caching mechanism for p2p systems," IEEE Transaction on Parallel and Distributed Systems, 2006.
[18]
A. Wierzbicki, N. Leibowitz, M. Ripeanu, and R. Wozniak, "Cache replacement policies revisited: The case of p2p traffic," In Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid, 2004.
Index Terms
- Evaluation study of a distributed caching based on query similarity in a P2P network
Index terms have been assigned to the content through auto-classification.
Recommendations
Web search results caching service for structured P2P networks
This paper proposes a two-level P2P caching strategy for Web search queries. The design is suitable for a fully distributed service platform based on managed peer boxes (set-top-box or DSL/cable modem) located at the edge of the network, where both ...
Proxy-Based Index Caching for Content-Addressable Networks
Content-Addressable Network (CAN) provides a mechanism that could retrieve objects in a P2P network by maintaining indices to those objects in a fully decentralized manner. In the CAN system, index caching is a useful technique for reducing the response ...
Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism
AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systemsOver the past few years, peer-to-peer(p2p) unstructured networks have emerged as an attractive paradigm for enabling online interactions between a large number of users in a decentralized manner. However, the decentralized nature of unstructured p2p ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2007
440 pages
ISBN:9781595937575
- Conference Chairs:
- Jianzhong Li,
- Wang-Chien Lee,
- Fabrizio Silvestri
Sponsors
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 06 June 2007
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 33 of 91 submissions, 36%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 221Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in