Measuring and analyzing the characteristics of Napster and Gnutella hosts

  title={Measuring and analyzing the characteristics of Napster and Gnutella hosts},
  author={Stefan Saroiu and Krishna P. Gummadi and Steven D. Gribble},
  journal={Multimedia Systems},
Abstract.The popularity of peer-to-peer multimedia file sharing applications such as Gnutella and Napster has created a flurry of recent research activity into peer-to-peer architectures. We believe that the proper evaluation of a peer-to-peer system must take into account the characteristics of the peers that choose to participate in it. Surprisingly, however, few of the peer-to-peer architectures currently being developed are evaluated with respect to such considerations. In this paper, we… 
Towards Open Tracing of P2P File Sharing Systems
This paper surveys existing work in the field of peer-to-peer monitoring and based upon this assessment of the state-of-the-art describes the design and implementation of the Open P2P tracing system, which aims to improve the research community’s understanding of P1P file sharing systems by providing continuous and up-to thedate traffic data which is anonymized and made freely accessible to all interested parties.
Characterizing files in the modern Gnutella network
This paper develops two new methodologies to capture accurate snapshots of available files in a large-scale P2P system and reveals several interesting properties of available Files in Gnutella that can be leveraged to improve the design and evaluation of P1P file-sharing applications.
Characterizing files in the modern Gnutella network: a measurement study
This paper developed a new methodology to capture accurate "snapshots" of available files in a large scale P2P system and conducted three types of analysis on available files: Static analysis, Topological analysis and Dynamic analysis.
A Statistical Study of Today's Gnutella
The measurements show that the assumption that query arrival follows Poisson distribution may not be true in Gnutella and most peers incline to share files of very limited types, even when MP3 files are excluded.
Characterizing Today's Gnutella Topology
A set of techniques to capture accurate snapshots of the Gnutella network, and to properly quantify the accuracy of the captured snapshots are presented, to provide a better understanding of several fundamental challenges in the design of unstructured overlays.
Simulating non-scanning worms on peer-to-peer networks
This paper identifies three strategies a non-scanning worm could use to propagate through P2P systems and provides a workload-driven simulation framework to characterize these worms and identify the parameters influencing their propagations.
Understanding churn in peer-to-peer networks
The understanding of churn is advanced by improving accuracy, comparing different P2P file sharingdistribution systems, and exploring new aspects of churn.
Characterizing Churn in Peer-to-Peer Networks
A detailed study of churn in widely-deployed applications from three different classes of P2P systems: an unstructured file-sharing system, a content-distribution system, and a distributed hash table system are presented.
One-click hosting services: a file-sharing hideout
This paper presents the first, to the authors' knowledge, detailed study of OCH traffic and services focusing on the most popular such service: RapidShare, and attempts to understand their service architecture, usage patterns, and content characteristics.
Towards a Better Understanding of Churn in Peer-to-Peer Networks
A new crawler is developed that can capture a complete snapshot of Gnutella network within a few minutes, and it is shown that peer uptime follows a power-law distribution rather than the commonly assumed Poisson distribution.


Sting: A TCP-based Network Measurement Tool
  • S. Savage
  • Computer Science
    USENIX Symposium on Internet Technologies and Systems
  • 1999
This paper explores using the TCP protocol to provide more accurate network measurements than traditional tools, while still preserving their near-universal applicability.
Measurements and analysis of end-to-end Internet dynamics
This work describes the resulting characterizations of Internet packet loss and delay, including general assessments of queueing time scales and available bandwidth, using a distributed framework developed for conducting end-to-end measurements.
A Comparison of File System Workloads
This paper describes the collection and analysis of file system traces from a variety of different environments, including both UNIX and NT systems, clients and servers, and instructional and production systems and develops a new metric for measuring file lifetime that accounts for files that are never deleted.
Measuring Bottleneck Link Speed in Packet-Switched Networks
End-to-end packet delay and loss behavior in the internet
The measured round trip delays of small UDP probe packets sent at regular time intervals are used to analyze the end-to-end packet delay and loss behavior in the Internet and find that the losses of probe packets are essentially random unless the probe traffic uses a large fraction of the available bandwidth.
Free Riding on Gnutella
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Congestion avoidance and control
In October of '86, the Internet had the first of what became a series of 'congestion collapses' during this period, the data throughput from LBL to UC Berkeley dropped from 32 Kbps to 40 bps.
Freenet: A Distributed Anonymous Information Storage and Retrieval System
We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet
Resilience of the internet to random breakdowns
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99.
What do packet dispersion techniques measure?
  • C. Dovrolis, P. Ramanathan, David Moore
  • Business
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
A capacity estimation methodology that has been implemented in a tool called pathrate and derived the effect of the cross traffic in the dispersion of long packet trains, showing that the ADR is not the available bandwidth in the path, as was assumed in previous work.