The Community for Technology Leaders
2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06) (2006)
Buffalo, New York
June 26, 2006 to June 29, 2006
ISBN: 0-7695-2593-8
pp: 332-338
Bo Yang , Pennsylvania State University, USA
Ali R. Hurson , Pennsylvania State University, USA
Yu Jiao , Oak Ridge National Laboratory, USA
Thomas E. Potok , Oak Ridge National Laboratory, USA
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 represent-tation 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.

B. Yang, A. R. Hurson, T. E. Potok and Y. Jiao, "Multimedia Correlation Analysis in Unstructured Peer-to-Peer Networks," 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06)(WOWMOM), Buffalo, New York, 2006, pp. 332-338.
100 ms
(Ver 3.3 (11022016))