Selective querying and other proposals for a less congested Gnutella network

Authors:
K. G. Srinivasa;Anuj Bhatt;Sagnik Dhar;K. R. Venugopal;L. M. Patnaik
Affiliations:
Data Mining Laboratory, M S Ramaiah Institute of Technology;Data Mining Laboratory, M S Ramaiah Institute of Technology;Data Mining Laboratory, M S Ramaiah Institute of Technology;Dept. of CSE, University Visvesvaraya College of Engineering, Bangalore University;Microprocessor Applications Laboratory, Indian Institute of Science, Bangalore
Venue:
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Year:
2007

Citing 1
Cited 0

Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network congestion and look-up times are of prime concern in peer-to-peer networks and Gnutella is no exception to this problem. A number of proposals and suggestions have been made to improve the scalability and performance and to reduce the congestion in Gnutella networks. An improvement would be to query a subgroup of positive respondents of the PING message that is exchanged among peers prior to the QUERY message. We discuss possible ways in order to determine "profitable" peers which could result in a successful transfer of a requested file and further highlight issues which we think would reduce congestion in the network.