By Topic

Supporting efficient keyword-based file search in peer-to-peer file sharing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lintao Liu ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA ; Kyung Dong Ryu ; Kang-Won Lee

Peer-to-peer (P2P) computing has become a popular distributed computing paradigm thanks to the abundant computing power of modern desktop workstations and widely available network connectivity. Although P2P file sharing provides a scalable alternative to conventional server-based approaches, providing efficient file search in a large-scale dynamic P2P system remains a challenging problem. We propose a set of mechanisms to provide a scalable keyword-based file search in distributed hash table (DHT) based P2P systems. Our proposed architecture, called keyword fusion, balances unfair storage consumptions at peers and transforms users' queries to contain focused search terms. Through trace-driven simulations, we show that keyword fusion can reduce the storage consumption of the top 5% most loaded nodes by 50% and decrease the search traffic by up to 67%, even in a modest scenario of combining two keywords.

Published in:

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:2 )

Date of Conference:

29 Nov.-3 Dec. 2004