An Efficient Search Mechanism in Unstructured P2P Networks Based on Semantic Group

Recently among various searching techniques, semantic-based searching has drawn significant attention. In this paper, we propose a novel and efficient search mechanism BF-SKIP (Biased walk, Flooding and Search with K-Iteration Preference). We use Vector Space Model (VSM) and relevance ranking algorithms to construct the overlay network. In BF-SKIP system, the search mechanism is divided into three stages (A, B and C). It significantly reduces the number of redundant messages and the number of visited nodes. Our analysis and simulation results show that the BF-SKIP scheme can outperform GES in terms of higher precision and lower search cost.

[1]  Hector Garcia-Molina,et al.  Semantic Overlay Networks for P2P Systems , 2004, AP2PC.

[2]  Jie Wu,et al.  A Class-Based Search System in Unstructured P2P Networks , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[3]  Yiming Hu,et al.  Enhancing Search Performance on Gnutella-Like P2P Systems , 2006, IEEE Transactions on Parallel and Distributed Systems.

[4]  Gurmeet Singh Manku,et al.  SETS: search enhanced by topic segmentation , 2003, SIGIR.

[5]  Elizabeth R. Jessup,et al.  Matrices, Vector Spaces, and Information Retrieval , 1999, SIAM Rev..

[6]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).