TY - GEN
T1 - Multimedia correlation analysis in unstructured peer-to-peer networks
AU - Yang, Bo
AU - Hurson, Ali R.
AU - Jiao, Yu
AU - Potok, Thomas E.
PY - 2006
Y1 - 2006
N2 - Recent years saw the rapid development of peer-to-peer (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.
AB - Recent years saw the rapid development of peer-to-peer (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.
UR - http://www.scopus.com/inward/record.url?scp=33845953732&partnerID=8YFLogxK
U2 - 10.1109/WOWMOM.2006.76
DO - 10.1109/WOWMOM.2006.76
M3 - Conference contribution
AN - SCOPUS:33845953732
SN - 0769525938
SN - 9780769525938
T3 - Proceedings - WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks
SP - 332
EP - 338
BT - Proceedings - WoWMoM 2006
T2 - WoWMoM 2006: 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Y2 - 26 June 2006 through 29 June 2006
ER -