Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Semantic grid: scientific issues, infrastructure, and methodology
Communications of the ACM - Transforming China
The Knowledge Grid
China's E-Science Knowledge Grid Environment
IEEE Intelligent Systems
Future Generation Computer Systems
A study of scalable search algorithm on unstructured P2P system
Proceedings of the 2nd international conference on Scalable information systems
Modeling message propagation in random graph networks
Computer Communications
A trust-based robust and efficient searching scheme for peer-to-peer networks
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Secure and privacy-aware searching in peer-to-peer networks
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Cooperative stalking of transient nomadic resources on overlay networks
Future Generation Computer Systems
| Hi-index | 0.08 |
To improve search efficiency and reduce unnecessary traffic in Peer-to-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.