Abstract
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the scalability problem, because P2P systems typically support millions of users online concurrently. Gnutella suffers from poor scaling due to its flooding-based search, resulting in excessive amounts of repeated query messages. Therefore, a good search protocol plays an important role in a system’s scalability. However, congestion, due to large query loads from users, definitely impacts on the performance of search protocols, and this consideration has received little attention from the research community. In this paper, we propose a congestion-aware search protocol for unstructured P2P networks. Our protocol consists of three parts—Congestion-Aware Forwarding, Random Early Stop and Emergency Signaling. The aim of our protocol is to integrate congestion control and object discovery functionality so that the search protocol can achieve good performance under congested networks and flash crowds. We perform extensive simulations to study our proposed protocol. The results show that our protocol can significantly reduce the hit delay while maintaining the high hit rate and also the congestion problems such as query loss and the peer overloading problem can be effectively alleviated.
References
Gnutella, http://www.gnutella.com
Gnutella2, http://www.gnutella2.com
KaZaA, http://www.kazaa.com
BitTorrent, http://bitconjurer.org/BitTorrent
Chawathe Y et al. (2003) Making Gnutella-like P2P systems scalable. In Proc. ACM SIGCOMM
Crespo A, Garcia-Molina H (2002) Routing Indices for Peer-to-Peer Systems. In Proc. 22nd International Conference on Distributed Computing Systems, pp. 23–32
E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks”, In: Proc. ACM SIGCOMM 2002.
Deerwester SC et al. (1990) Indexing by Latent Semantic Analysis. Journal of the American Society of Information Science 41(6):391–407
Ganesan P et al. (2003) YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. In Proc. IEEE INFOCOM
He Q, Ammar M (2004) Congestion Control and Message Loss in Gnutella Networks. In Proc. Conference on Multimedia Computing and Networking, pp. 16–27
Kashani FB, Shahabi C (2003) Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as Complex System. In Proc. 3rd International Workshop on Global and Peer-to-Peer Computing, pp. 351–358
Kalogeraki V et al. (2002) A Local Search Mechanism for Peer-to-Peer Networks. In Proc. Eleventh International Conference on Information and Knowledge Management, pp. 300–307
Kwong KW, Tsang DHK (2005) On the Relationship of Node Capacity Distribution and P2P Topology Formation. In Proc. IEEE Workshop on High-Performance Switching and Routing
J. Liang et al., “Understanding KaZaA,” submitted, 2004.
Lv Q et al. (2002) Search and Replication in Unstructured Peer-to-Peer Networks. In Proc. 16th International Conference on Supercomputing, pp. 84–95
Ritter J, Why Gnutella Can’t Scale. No, Really. [online] http://www.darkridge.com/jpr5/doc/gnutella.html
Saroui S et al. (2002) Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. Multimedia Computing and Networking
Stoica I et al. (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. ACM SIGCOMM
Ratnasamy S et al. (2001) A Scalable Content-Addressable Network. In Proc. ACM SIGCOMM
Tang C et al. (2003) Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In Proc. ACM SIGCOMM
Tsoumakos D, Roussopoulos N (2003) Adaptive Probabilistic Search for Peer-to-Peer Networks. In Proc. 3rd IEEE International Conference on P2P Computing, pp. 102–109
Tsoumakos D, Roussopoulos N (2003) A Comparison of Peer-to-Peer Search Methods. 6th International Workshop on the Web and Databases
Wang C et al. (2004) Distributed Caching and Adaptive Search in Multilayer P2P networks. In Proc. 24th International Conference on Distributed Computing Systems, pp. 219–226
Zhuang Z, et al. (2003) Hybrid Periodical Flooding in Unstructured Networks. In Proc. 32th International Conference on Parallel Processing, pp. 171–178
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kwong, K.W., Tsang, D.H.K. A congestion-aware search protocol for heterogeneous peer-to-peer networks. J Supercomput 36, 265–282 (2006). https://doi.org/10.1007/s11227-006-8297-y
Issue Date:
DOI: https://doi.org/10.1007/s11227-006-8297-y