Skip to main content
Log in

A congestion-aware search protocol for heterogeneous peer-to-peer networks

The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Gnutella, http://www.gnutella.com

  2. Gnutella2, http://www.gnutella2.com

  3. KaZaA, http://www.kazaa.com

  4. BitTorrent, http://bitconjurer.org/BitTorrent

  5. Chawathe Y et al. (2003) Making Gnutella-like P2P systems scalable. In Proc. ACM SIGCOMM

  6. 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

  7. E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks”, In: Proc. ACM SIGCOMM 2002.

  8. Deerwester SC et al. (1990) Indexing by Latent Semantic Analysis. Journal of the American Society of Information Science 41(6):391–407

    Article  Google Scholar 

  9. Ganesan P et al. (2003) YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. In Proc. IEEE INFOCOM

  10. He Q, Ammar M (2004) Congestion Control and Message Loss in Gnutella Networks. In Proc. Conference on Multimedia Computing and Networking, pp. 16–27

  11. 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

  12. 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

  13. 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

  14. J. Liang et al., “Understanding KaZaA,” submitted, 2004.

  15. Lv Q et al. (2002) Search and Replication in Unstructured Peer-to-Peer Networks. In Proc. 16th International Conference on Supercomputing, pp. 84–95

  16. Ritter J, Why Gnutella Can’t Scale. No, Really. [online] http://www.darkridge.com/jpr5/doc/gnutella.html

  17. Saroui S et al. (2002) Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. Multimedia Computing and Networking

  18. Stoica I et al. (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. ACM SIGCOMM

  19. Ratnasamy S et al. (2001) A Scalable Content-Addressable Network. In Proc. ACM SIGCOMM

  20. Tang C et al. (2003) Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In Proc. ACM SIGCOMM

  21. 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

  22. Tsoumakos D, Roussopoulos N (2003) A Comparison of Peer-to-Peer Search Methods. 6th International Workshop on the Web and Databases

  23. 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

  24. Zhuang Z, et al. (2003) Hybrid Periodical Flooding in Unstructured Networks. In Proc. 32th International Conference on Parallel Processing, pp. 171–178

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kin Wah Kwong.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-8297-y

Keywords

Navigation