An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks

Authors:
Jian Yang;Yiping Zhong;Shiyong Zhang
Affiliations:
-;-;-
Venue:
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Year:
2003

Citing 0
Cited 4

Resource discovery in locality-aware group-based semantic overlay of peer-to-peer networks

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Scalable Grouping Based on Neuro-Fuzzy Clustering for P2P Networks

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
An adaptive group-based reputation system in peer-to-peer networks

WINE'05 Proceedings of the First international conference on Internet and Network Economics
iTrust: trustworthy information publication, search and retrieval

ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient search mechanism is a very important aspect of any peer-to-peer system. Current search mechanisms in both DHT-based structured peer-to-peer networks and unstructured peer-to-peer networks are either lack of flexibility or very inefficient. In this paper, we proposean efficient search mechanism based on interest-group, which is formed by nodes sharing similar interests. Metadata are used to describe and represent documents that nodes share with others. We deploy Metadata Slide Window and metadata replication to facilitate the search process. Preliminary analysis and simulation results prove the effectiveness and efficiency of the proposed search mechanism.