Recent years saw the rapid development of peer-topeer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topologies and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could remedy the technological constraints of P2P networks. However, traditional caching techniques have some major shortcomings that make them unsuitable for similarity search, such as the lack of semantic locality representation and the rigidness of exact matching on data objects. To facilitate the efficient similarity search, we propose semantic-aware caching scheme (SAC) in this paper. The proposed scheme is hierarchy-free, fully dynamic, non-flooding, and do not add much system overhead. By exploring the content distribution, SAC drastically reduces the cost of similarity-based k-NN retrieval in P2P networks. The performance of SAC is evaluated through simulation study and compared against several search schemes as advanced in the literature.

Meeting Name

2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'06)


Computer Science

Keywords and Phrases

Peer-To-Peer Networks; Caching; K-Nearest-Neighbor Retrieval; Network Traffic; Semantic Locality Representation; Ultimedia Correlation

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type





© 2006 Institute of Electrical and Electronics Engineers (IEEE) Computer Society, All rights reserved.

Full Text Link