By Topic

An unstructured P2P network search algorithm based on percolation theory

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

2 Author(s)
Li Xiaolei ; Sch. of Electron. & Inf., Ningbo Dahongying Univ., Ningbo, China ; Wang Xiangrong

The measurement of a search algorithm for unstructed P2P network are the hit rate and redundant links. Most current search algorithms are unable to guarantee the connection of the network and reduce redundant links effectively both. In this paper, a novel search algorithm is proposed in which percolation theory is employed, Experiment proves that the proposed algorithm can obtain a better result.

Published in:

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on  (Volume:6 )

Date of Conference:

12-14 Aug. 2011