A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Topology adaptation based on mobile agent in unstructured p2p networks
PCM'12 Proceedings of the 13th Pacific-Rim conference on Advances in Multimedia Information Processing
Hi-index | 0.00 |
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. Recently, different search protocols have been proposed to remedy the problems in Gnutella's flooding. However, congestion due to large query loads from users and peer heterogeneity definitely impact 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. The aim of our protocol is to integrate congestion control and object discovery functionality so that it can achieve good performance under congested networks and flash crowds. The simulation results show that our protocol can largely reduce a hit delay while maintaining a high hit rate, and the congestion problems such as query loss and system overloading can be effectively alleviated.