logo Netzschleuder network catalog, repository, and centrifuge

gnutella — Gnutella p2p networks (2002)

Description

Snapshots of the Gnutella peer-to-peer file sharing network, collected in August 2002 and distributed by the Stanford Network Analysis Project (SNAP). Nodes are hosts in the Gnutella overlay network, and a directed edge represents a connection between two hosts (the meaning of the edge direction is not documented by the source). Each network is named after the day of August 2002 on which the snapshot was taken (04, 05, 06, 08, 09, 24, 25, 30 and 31). The vertex property name holds the node ID of the source data.

Tags
Technological Peer-to-peer Unweighted
Citation
  • M. Ripeanu, A. Iamnitchi, and I. Foster, "Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design." IEEE Internet Computing 6(1), 50-57 (2002). 10.1109/4236.978369 Sci-Hub
Upstream URL OK
https://snap.stanford.edu/data/p2p-Gnutella04.html
https://snap.stanford.edu/data/p2p-Gnutella05.html
https://snap.stanford.edu/data/p2p-Gnutella06.html
https://snap.stanford.edu/data/p2p-Gnutella08.html
https://snap.stanford.edu/data/p2p-Gnutella09.html
https://snap.stanford.edu/data/p2p-Gnutella24.html
https://snap.stanford.edu/data/p2p-Gnutella25.html
https://snap.stanford.edu/data/p2p-Gnutella30.html
https://snap.stanford.edu/data/p2p-Gnutella31.html
Networks
Tip: click on a column header to sort the list, or hover over it for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
04 10,879 39,994 3.68 6.97 15.28 45.18 -0.01 0.01 10 1.00 Directed Unipartite 233 KiB 340 KiB 342 KiB 285 KiB
05 8,846 31,839 3.60 7.39 21.58 8.62 0.01 0.01 9 1.00 Directed Unipartite name 195 KiB 286 KiB 293 KiB 250 KiB
06 8,717 31,525 3.62 7.20 20.47 7.77 0.05 0.01 10 1.00 Directed Unipartite 183 KiB 270 KiB 271 KiB 226 KiB
08 6,301 20,777 3.30 8.54 26.51 24.27 0.04 0.02 9 1.00 Directed Unipartite 129 KiB 183 KiB 183 KiB 152 KiB
09 8,114 26,013 3.21 8.17 26.56 27.95 0.03 0.02 10 1.00 Directed Unipartite 167 KiB 245 KiB 242 KiB 198 KiB
24 26,518 65,369 2.47 5.92 10.78 14.65 -0.01 0.00 11 1.00 Directed Unipartite 525 KiB 744 KiB 730 KiB 610 KiB
25 22,687 54,705 2.41 5.34 9.38 34.75 -0.17 0.00 11 1.00 Directed Unipartite 439 KiB 622 KiB 629 KiB 516 KiB
30 36,682 88,328 2.41 5.66 11.39 15.82 -0.10 0.01 11 1.00 Directed Unipartite 706 KiB 979 KiB 977 KiB 836 KiB
31 62,586 147,892 2.36 5.70 11.48 16.19 -0.09 0.00 11 1.00 Directed Unipartite 1.2 MiB 1.7 MiB 1.7 MiB 1.4 MiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.