Open Access
Incentives Build Robustness in Bit-Torrent
B. Cohen
- 01 Jan 2003
TL;DR: The BitTorrent file distribution system uses tit-fortat as a method of seeking pareto efficiency, which achieves a higher level of robustness and resource utilization than any currently known cooperative technique.
read more
Abstract: The BitTorrent file distribution system uses tit-fortat as a method of seeking pareto efficiency. It achieves a higher level of robustness and resource utilization than any currently known cooperative technique. We explain what BitTorrent does, and how economic methods are used to achieve that goal. 1 What BitTorrent Does When a file is made available using HTTP, all upload cost is placed on the hosting machine. With BitTorrent, when multiple people are downloading the same file at the same time, they upload pieces of the file to each other. This redistributes the cost of upload to downloaders, (where it is often not even metered), thus making hosting a file with a potentially unlimited number of downloaders affordable. Researchers have attempted to find practical techniqes to do this before[3]. It has not been previously deployed on a large scale because the logistical and robustness problems are quite difficult. Simply figuring out which peers have what parts of the file and where they should be sent is difficult to do without incurring a huge overhead. In addition, real deployments experience very high churn rates. Peers rarely connect for more than a few hours, and frequently for only a few minutes [4]. Finally, there is a general problem of fairness [1]. The total download rate across all downloaders must, of mathematical necessity, be equal to the total upload rate. The strategy for allocating upload which seems most likely to make peers happy with their download rates is to make each peer’s download rate be proportional to their upload rate. In practice it’s very difficult to keep peer download rates from sometimes dropping to zero by chance, much less make upload and download rates be correlated. We will explain how BitTorrent solves all of these problems well. 1.1 BitTorrent Interface BitTorrent’s interface is almost the simplest possible. Users launch it by clicking on a hyperlink to the file they wish to download, and are given a standard “Save As” dialog, followed by a download progress dialog which is mostly notable for having an upload rate in addition to a download rate. This extreme ease of use has contributed greatly to BitTorrent’s adoption, and may even be more important than, although it certainly complements, the performance and cost redistribution features which are described in this paper.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Decentralized Online Social Network Using Peer-to-Peer Technology
Manh Ha Tran,Van Sinh Nguyen,Synh Viet-Uyen Ha +2 more
- 09 Feb 2016
TL;DR: The Gnutella protocol is extended to provide the authentication and posting services on the social network to provide users the capability of managing the dissemination of user data, searching user data on the data silos of the network, and consolidating user data from various social networks.
Peer-to-peer direct sales
A. Wierzbicki,K. Goworek +1 more
- 31 Aug 2005
TL;DR: An economic analysis of a business model for commercial content delivery networks (CDN) based on the peer-to-peer model is described and the profit obtained by the content provider in a client-server CDN and the P2P CDN is compared and the stable-state prices are analyzed.
12
C-trust: A trust management system to improve fairness on circular P2P networks
TL;DR: C-Trust, a trust management system which is focused on fairness for P2P networks is proposed, able to mark freeloaders, identify their severity of abusion and punish them accordingly by getting help from current circular structured designs.
12
•Dissertation
Modeling and Analysis of Reliable Peer-to-Peer Storage Systems
Julian Monteiro
- 16 Nov 2010
TL;DR: A simple Markov chain model is described that harnesses the dynamics of a storage system under the effects of peer failures and of data repair, and a new stochastic model based on a fluid approximation is proposed that captures the deviations around the mean behavior.
NFS-cc: tuning NFS for concurrent read sharing
Ying Xu,Brett D. Fleisch +1 more
- 31 Jan 2004
TL;DR: Preliminary performance measurements show that the aggregate read throughput of NFS-cc was increased with the number of clients and reached as high as 42.6 MB/s with 12 clients connected by a fast Ethernet.
12
References
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Petar Maymounkov,David Mazières +1 more
- 07 Mar 2002
TL;DR: In this paper, the authors describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment, which routes queries and locates nodes using a novel XOR-based metric topology.
Free riding on Gnutella
TL;DR: 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.
1.8K
SplitStream: High-Bandwidth Content Distribution in Cooperative Environments
Miguel Castro,Peter Druschel,Anne-Marie Kermarrec,Animesh Nandi,Antony Rowstron,Atul Singh +5 more
- 21 Feb 2003
TL;DR: SplitStream is a high-bandwidth content distribution system based on application-level multicast that distributes the forwarding load among all the participants, and is able to accommodate participating nodes with different bandwidth capacities.
•Book
Linked: The New Science of Networks
Albert-László Barabási
- 14 May 2002
TL;DR: An ink jet comprises an elastic tubular member characterized by piezoelectric properties that is terminated in an orifice adapted to pass droplets of ink when the chamber formed within the tubular members is reduced in size.