Issue No.12 - December (2006 vol.17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.173
<p><b>Abstract</b>—The big challenges facing the search techniques on Gnutella-like peer-to-peer networks are search efficiency and quality of search results. In this paper, leveraging information retrieval (IR) algorithms such as Vector Space Model (VSM) and relevance ranking algorithms, we present GES (<b>G</b>nutella with <b>E</b>fficient <b>S</b>earch) to improve search performance. The key idea is that GES uses a distributed topology adaptation algorithm to organize semantically relevant nodes into same semantic groups by using the notion of node vector. Given a query, GES employs an efficient search protocol to direct the query to the most relevant semantic groups for answers, thereby achieving high recall with probing only a small fraction of nodes. To the best of our knowledge, GES is the first to identify node vector size as an important role in impacting search performance and to show that the node vector size offers a good trade-off between search performance and bandwidth cost. Moreover, GES adopts automatic query expansion and local data clustering to improve search performance. We show that GES is efficient and even outperforms the centralized node clustering system SETS. For example, in the scenario where node capacity is heterogeneous, GES can achieve 73 percent recall when probing only 20 percent nodes, outperforming SETS by about 18 percent.</p>
Peer-to-peer, topology adaptation, biased walk, semantic group, node vector, recall, information retrieval.
Yingwu Zhu, "Enhancing Search Performance on Gnutella-Like P2P Systems", IEEE Transactions on Parallel & Distributed Systems, vol.17, no. 12, pp. 1482-1495, December 2006, doi:10.1109/TPDS.2006.173