An efficient distributed search method

Authors:
Haitao Chen;Zhenghu Gong;Zunguo Huang
Affiliations:
School of Computer Science, National University of Defense Technology, Changsha, Hunan, China;School of Computer Science, National University of Defense Technology, Changsha, Hunan, China;School of Computer Science, National University of Defense Technology, Changsha, Hunan, China
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 4
Cited 0

Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A local search mechanism for peer-to-peer networks

Proceedings of the eleventh international conference on Information and knowledge management
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks

Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Peer-to-peer information retrieval using self-organizing semantic overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The big challenge of constructing P2P applications is how to implement efficient distributed file searching in complex environment which implies huge-amount users and uncontrollable nodes. FriendSearch is introduced to improve the efficiency and scalability of distributed file searching. FriendSearch introduces a new hybrid architecture in which the storage and search of raw file is based on DHT network, but the storage and search of meta-data is based on unstructured P2P network. FriendSearch learns interest similarity between participating nodes and uses it to construct friend relations. The forwarding of queries is limited to friend nodes with similar interests. Simulation tests show that FriendSearch algorithm is both efficient and scalable.