Improving Search on Gnutella-Like P2P Systems

Authors:
Qi Zhao;Jiaoyao Liu;Jingdong Xu
Affiliations:
Department of Computer Science, Nankai University, Tianjin 300072, China;Department of Computer Science, Nankai University, Tianjin 300072, China;Department of Computer Science, Nankai University, Tianjin 300072, China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Year:
2007

Citing 4
Cited 0

A local search mechanism for peer-to-peer networks

Proceedings of the eleventh international conference on Information and knowledge management
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks

HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gnutella has many weaknesses. Queries are handled identically no matter how popular the querying objects are. Blind flooding causes a great amount of redundant messages. In this paper, we explore how to retain the simplicity of Gnutella, while addressing its inherent weaknesses. We propose GPP, a content location solution in which multiple proxy peers are adopted to help a source peer locate desired objects. The underlying philosophy is to route queries to the areas where more results can be found. Towards this end, peers in GPP collaborate to achieve better search performance. Simulation results show that GPP outperforms Modified BFS and s-APS.