DocumentCode
3365821
Title
An unstructured P2P network search algorithm based on percolation theory
Author
Li Xiaolei ; Wang Xiangrong
Author_Institution
Sch. of Electron. & Inf., Ningbo Dahongying Univ., Ningbo, China
Volume
6
fYear
2011
fDate
12-14 Aug. 2011
Firstpage
2833
Lastpage
2836
Abstract
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.
Keywords
graph theory; peer-to-peer computing; search problems; percolation theory; redundant links; search algorithm; unstructured P2P network; Computational modeling; Educational institutions; Mathematical model; Network topology; Peer to peer computing; Probability; Routing; P2P; percolation; search algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on
Conference_Location
Harbin, Heilongjiang, China
Print_ISBN
978-1-61284-087-1
Type
conf
DOI
10.1109/EMEIT.2011.6023692
Filename
6023692
Link To Document