scispace - formally typeset
Proceedings ArticleDOI

Peer-to-peer architecture case study: Gnutella network

Reads0
Chats0
TLDR
A 'crawler' is built to extract the topology of Gnutella's application level network, a topology graph is analyzed and the current configuration has the benefits and drawbacks of a power-law structure.
Abstract
Despite recent excitement generated by the P2P paradigm and despite surprisingly fast deployment of some P2P applications, there are few quantitative evaluations of P2P system behavior. Due to its open architecture and achieved scale, Gnutella is an interesting P2P architecture case study. Gnutella, like most other P2P applications, builds at the application level a virtual network with its own routing mechanisms. The topology of this overlay network and the routing mechanisms used have a significant influence on application properties such as performance, reliability, and scalability. We built a 'crawler' to extract the topology of Gnutella's application level network, we analyze the topology graph and evaluate generated network traffic. We find that although Gnutella is not a pure power-law network, its current configuration has the benefits and drawbacks of a power-law structure. These findings lead us to propose changes to the Gnutella protocol and implementations that bring significant performance and scalability improvements.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Modeling and performance analysis of BitTorrent-like peer-to-peer networks

TL;DR: This paper presents a simple fluid model and considers the built-in incentive mechanism of BitTorrent and its effect on network performance, and provides numerical results based on both simulations and real traces obtained from the Internet.
Proceedings ArticleDOI

Service capacity of peer to peer networks

TL;DR: This work considers a transient regime which is key to capturing the ability of P2P file sharing systems to handle bursty traffic, e.g., flash crowds and finds that the average delays scale well in the offered load.
Proceedings ArticleDOI

Choosing reputable servents in a P2P network

TL;DR: An approach to P2P security where servents can keep track, and share with others, information about the reputation of their peers is proposed, based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download.
Book ChapterDOI

On Fully Decentralized Resource Discovery in Grid Environments

TL;DR: This paper evaluates a set of request-forwarding algorithms in a fully decentralized architecture, designed to accommodate heterogeneity (in both sharing policies and resource types) and dynamism, and analyzes the correlation between resource discovery performance and sharing characteristics.
Journal ArticleDOI

Managing and sharing servants' reputations in P2P systems

TL;DR: An approach to P2P security where servants can keep track, and share with others, information about the reputation of their peers is proposed, based on a distributed polling algorithm by which resource requestors can assess the reliability of perspective providers before initiating the download.
References
More filters
Book

Elements of information theory

TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book

Data Mining: Concepts and Techniques

TL;DR: This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data.
Proceedings ArticleDOI

Chord: A scalable peer-to-peer lookup service for internet applications

TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Journal ArticleDOI

Error and attack tolerance of complex networks

TL;DR: It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
Related Papers (5)