Group-based search in unstructured peer-to-peer networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
SPID: a novel P2P-based information diffusion scheme for mobile networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
SCDN: Stable Content Distribution Network based on demands
Journal of Parallel and Distributed Computing
The state of the art in content-based image retrieval in P2P networks
ICIMCS '10 Proceedings of the Second International Conference on Internet Multimedia Computing and Service
The GOSSPLE anonymous social network
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
Small-world particle swarm optimization with topology adaptation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of information shared in such systems mandates efficient semantic based search instead of key-based search. This paper presents the design of an overlay network, namely semantic small world (SSW), that facilitates efficient semantic based search in P2P systems. SSW achieves the efficiency based on the following four ideas: 1) semantic clustering: peers with similar semantics organize into peer clusters; 2) dimension reduction: to address the high maintenance overhead associated with capturing high-dimensional data semantics in the overlay, peer clusters are adaptively mapped to a one-dimensional naming space; 3) small world network: peer clusters form into a one-dimensional small world network, which is search efficient with low maintenance overhead; 4) efficient search algorithms: peers perform efficient semantic based search, including approximate point query and range query, in the proposed overlay. Extensive experiments using both synthetic data and real data demonstrate that SSW is superior to the state-of-the-art on various aspects, including scalability, maintenance overhead, adaptivity to distribution of data and locality of interest, resilience to peer failures, load balancing, and efficiency in support of various types of queries on data objects with high dimensions.