Bootstrapping in Gnutella: A Measurement Study

Karbhari, Pradnya; Ammar, Mostafa; Dhamdhere, Amogh; Raj, Himanshu; Riley, George F.; Zegura, Ellen

doi:10.1007/978-3-540-24668-8_3

Cited by 34 publications

(20 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These studies cover several topics: (i) file characteristics [31]- [34], (ii) transfer characteristics [32], [35], (iii) peer characteristics [13], [23], (vi) query characteristics [33], [36]- [38], and (v) comparisons of different implementations [39], [40]. Since they explore different aspects of peer-to-peer networks, these studies complement our work.…”

Section: Related Workmentioning

confidence: 82%

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

Stutzbach¹,

Rejaie²,

Sen³

2005

Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement - IMC '05

102

109

View full text Add to dashboard Cite

Abstract-In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution. Leveraging recent overlay snapshots captured with Cruiser, we characterize the graphrelated properties of individual overlay snapshots and overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite overlay dynamics.

show abstract

Section: Related Workmentioning

confidence: 82%

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

Stutzbach¹,

Rejaie²,

Sen³

2005

Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement - IMC '05

102

109

View full text Add to dashboard Cite

show abstract

“…This is suitable in realistic scenarios, e.g. during bootstrapping in p2p networks like Gnutella [5], a newly arriving node need not evaluate the trust to all the nodes in the network. Rather it will preferably connect to a small number of trusted peers and hence need to obtain the trust of only a small subset of the whole network.…”

Section: Trustwebrankmentioning

confidence: 99%

A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks

Chandra

Scholtes

Ganguly

et al. 2012

2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message overhead involved in exhaustively calculating and propagating the trust estimates by the remote nodes. However, in any practical scenario, nodes generally communicate with a small subset of nodes and thus exhaustively estimating the trust of all the nodes can lead to huge resource consumption. In contrast, our mechanism can be tuned to locate a desired subset of trusted nodes, based on the allowable overhead, with respect to a particular user. The mechanism is based on a simple exchange of random walk messages and nodes counting the number of times they are being hit by random walkers of nodes in their neighborhood. Simulation results to analyze the effectiveness of the algorithm show that using the proposed algorithm, nodes identify the top trusted nodes in the network with a very high probability by exploring only around 45% of the total nodes, and in turn generates nearly 90% less overhead as compared to an exhaustive trust estimation mechanism, named TrustWebRank. Finally, we provide a measure of the global trustworthiness of a node; simulation results indicate that the measures generated using our mechanism differ by only around 0.6% as compared to TrustWebRank.

show abstract

“…In order to learn more about traffic information, some P2P traffic identification research emphasized detailed features of a small subset of P2P protocols and/or networks [4][5][6], often motivated by the dominance of that protocol in a particular provider's infrastructure or during a specific time period. Some other systems used information such as known port number, flow level analysis [1], payload information (such as signatures) [8], topological feature and transport layer features [7].…”

Section: Related Research Literaturementioning

confidence: 99%

“…To address the afore-mentioned drawbacks of port-based classification, several payload-based analysis techniques have been proposed [5,7,11]. In this approach, packet payloads are analyzed to determine whether they contain characteristic signatures of known applications.…”

Section: Payload-based Featurementioning

confidence: 99%

Online hybrid traffic classifier for Peer-to-Peer systems based on network processors

Chen

Yang

Chen

et al. 2009

Applied Soft Computing

View full text Add to dashboard Cite

Bootstrapping in Gnutella: A Measurement Study

Cited by 34 publications

References 2 publications

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

Characterizing unstructured overlay topologies in modern P2P file-sharing systems

A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks

Online hybrid traffic classifier for Peer-to-Peer systems based on network processors

Contact Info

Product

Resources

About