Broker-placement in latency-aware peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Analysis of Interest-Community Facilitated Peer-to-Peer Search
Agents and Peer-to-Peer Computing
Semantic and cooperative document delivery over distributed systems
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Overlay management for fully distributed user-based collaborative filtering
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Recent measurement studies of file-sharing peer-to-peer networks have demonstrated the presence of semantic proximity between peers and between shared files. In this paper we tackle the problem of exploiting the semantic locality of peer requests to improve the performance of a P2P network by the use of semantic caches. Such caches group together peers with similar interests as well as files with similar request patterns. The resulting two-level caching infrastructure can be integrated in a very natural way with the superpeer concept. The super-peers in our system cache pointers to files recently requested by their client peers. The client peers, on the other hand, keep caches of super-peers that answered most of their requests in the past. As a consequence, peers with similar interests are grouped (clustered) under the same super-peers, and also files with similar request patterns are indexed by the same super-peers. We discuss the design choices and optimizations of the presented model. We also evaluate our system versus the network that uses only one level of semantic caches.