Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Transparent Query Caching in Peer-to-Peer Overlay Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Distributed Caching and Adaptive Search in Multilayer P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Cache replacement policies revisited: the case of P2P traffic
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Density-Based Clustering for Similarity Search in a P2P Network
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
DiCAS: An Efficient Distributed Caching Mechanism for P2P Systems
IEEE Transactions on Parallel and Distributed Systems
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Distributed caching with centralized control
Computer Communications
| Hi-index | 0.00 |
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.