By Topic

A Peer-to-Peer Resources Search Algorithm Based on Small-World Model

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
$33 $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

2 Author(s)
Qian Su ; Sch. of Inf. Sci. & Eng., Yunnan Univ., Kunming ; Xuejie Zhang

Resources search has become a hot research issue in peer-to-peer (P2P) systems. In most unstructured P2P systems with flooding mechanism, with exponential growth of the number of messages, serious network congestion and waste of bandwidth result in low efficiency of resources search. In this paper, we propose an unstructured P2P resources search algorithm based on small-world model, in which peers perform k-means clustering on local resources separately, and then build a few similar-links between peers who own similar clusters and some random-links between non-similar peers. Experiment results demonstrate that our algorithm can effectively shorten the average searching length and get high success rate.

Published in:

Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on  (Volume:3 )

Date of Conference:

6-8 Jan. 2009