inria-00112066, version 1
Clustering and Sharing Incentives in BitTorrent Systems
Arnaud Legout
1Nikitas Liogkas
a, 2Eddie Kohler
a, 2Lixia Zhang
a, 2
(2006)
Abstract: Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. Consequently, it is important to gain a full understanding of how these protocols behave in practice and how their parameters impact overall performance. We present the first experimental investigation of the peer selection strategy of the popular BitTorrent protocol in an instrumented private torrent. By observing the decisions of more than 40 nodes, we validate three BitTorrent properties that, though widely believed to hold, have not been demonstrated experimentally. These include the clustering of similar-bandwidth peers, the effectiveness of BitTorrent's sharing incentives, and the peers' high average upload utilization. In addition, our results show that BitTorrent's new choking algorithm in seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to the absence of peer clustering and less effective sharing incentives. Based on our observations, we provide guidelines for seed provisioning by content providers, and discuss a tracker protocol extension that addresses an identified limitation of the protocol.
- a – University of California, Los Angeles
- 1: PLANETE (INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes)
- INRIA
- 2: Computer Science Department [UCLA] (UCLA-CS)
- University of California, Los Angeles
- Domain : Computer Science/Networking and Telecommunication
- Keywords : peer-to-peer – BitTorrent – choking algorithm – sharing incentives – clustering
- inria-00112066, version 1
- http://hal.inria.fr/inria-00112066
- oai:hal.inria.fr:inria-00112066
- From: Arnaud Legout
- Submitted on: Tuesday, 21 November 2006 12:44:10
- Updated on: Wednesday, 1 October 2008 11:02:01






Associated documents

Export