Sciweavers

Share
WWW
2005
ACM

Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks

9 years 1 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential walk (P-Walk). Every peer ranks its neighbors according to searching experience. The highly ranked neighbors have higher probabilities to be queried. Simulation results show that P-Walk is not only efficient, but also robust against malicious behaviors. Furthermore, we measure peers’ rank distribution and draw implications. Categories and Subject Descriptors: G.3 [Mathematics of Computing]: Probability and Statistics – Experimental design, Probabilistic algorithms. General Terms: Algorithms, Design, Experimentation. Keywords P2P, search, probability, trust, power-law.
Hai Zhuge, Xue Chen, Xiaoping Sun
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where WWW
Authors Hai Zhuge, Xue Chen, Xiaoping Sun
Comments (0)
books