The Cost of Peer Discovery and Searching in the Gnutella Peer-to-peer File Sharing Protocol

Authors:
Marius Portmann;Pipat Sookavatana;Sébastien Ardon;Aruna Seneviratne
Affiliations:
-;-;-;-
Venue:
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Year:
2001

Citing 0
Cited 4

Broadcasting in unstructured peer-to-peer overlay networks

Theoretical Computer Science - Complex networks
Search+: a resource efficient peer-to-peer service discovery mechanism

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Caching indices for efficient lookup in structured overlay networks

AP2PC'05 Proceedings of the 4th international conference on Agents and Peer-to-Peer Computing
A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A lot of attention has recently been focused on Peer-to-peer file sharing systems. Gnutella is a fully distributedpeer-to-peer protocol, without the need for a centralentity. This increases the reliability of the system byavoiding a single point of failure as well making it moreimmune to legal attack. The two main features of theGnutella protocol, discovery of peers and searching forfiles are implemented by passing different types ofmessages between the nodes of the Gnutella overlaynetwork. Due to its fully distributed nature, Gnutellarelies on flooding to route most of these messages, whichimmediately raises the question of cost and scalability. Inthis paper, we study these aspects of the Gnutella protocolby means of simulation, also considering the influence ofthe topology of the Gnutella network.