HAL - INRIA :: [inria-00137444, version 2] Clustering and Sharing Incentives in BitTorrent Systems

inria-00137444, version 2

arXiv:cs.NI/0703107

See detailed view

BibTeX EndNote TEI RefWorks

%% inria-00137444, version 2
%% http://hal.inria.fr/inria-00137444/en/
@inproceedings{LEGOUT:2007:INRIA-00137444:2,
	title = { {C}lustering and {S}haring {I}ncentives in {B}it{T}orrent {S}ystems},
	author = {{L}egout, {A}rnaud and {L}iogkas, {N}ikitas and {K}ohler, {E}ddie and {Z}hang, {L}ixia},
	abstract = {{P}eer-to-peer protocols play an increasingly instrumental role in {I}nternet content distribution. {I}t is therefore important to gain a complete understanding of how these protocols behave in practice and how their operating parameters affect overall system performance. {T}his paper presents the first detailed experimental investigation of the peer selection strategy in the popular {B}it{T}orrent protocol. {B}y observing more than 40 nodes in instrumented private torrents, we validate three protocol properties that, though believed to hold, have not been previously demonstrated experimentally: the clustering of similar-bandwidth peers, the effectiveness of {B}it{T}orrent's sharing incentives, and the peers' high uplink utilization. {I}n addition, we observe that {B}it{T}orrent's modified choking algorithm in seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to absence of peer clustering and less effective sharing incentives. {B}ased on our results, we provide guidelines for seed provisioning by content providers, and discuss a tracker protocol extension that addresses an identified limitation of the protocol.},
	language = {{E}nglish},
	affiliation = {{PLANETE} - {INRIA} {S}ophia {A}ntipolis / {INRIA} {R}h{\^o}ne-{A}lpes - {INRIA} - {C}omputer {S}cience {D}epartment [{UCLA}] - {UCLA}-{CS} - {U}niversity of {C}alifornia, {L}os {A}ngeles },
	booktitle = {{ACM} {SIGMETRICS}'2007 },
	address = {{C}alifornia },
	note = {{T}his article is the author version of a paper accepted at {ACM} {SIGMETRICS}'2007. {I}n particular, this paper is different from the technical report inria-00112066, version 1 - 21 {N}ovember 2006. {T}he technical report inria-00112066, version 1 - 21 {N}ovember 2006 is a extended version of this paper (same title and authors, but different content) {V}ersion 2 is the same content as version 1, but with a different class in order to match the camera ready format for {SIGMETRICS} },
	audience = {not specified },
	day = {12},
	month = {06},
	year = {2007},
	URL = {http://hal.inria.fr/inria-00137444/en/},
}

%F inria-00137444, version 2
%0 Conference Proceedings
%U http://hal.inria.fr/inria-00137444/en/
%2 INFO:INFO_NI
%T Clustering and Sharing Incentives in BitTorrent Systems
%A Legout, Arnaud
%A Liogkas, Nikitas
%A Kohler, Eddie
%A Zhang, Lixia
%A Legout, A.
%A Liogkas, N.
%A Kohler, E.
%A Zhang, L.
%A Legout A. et al
%+ PLANETE - INRIA Sophia Antipolis / INRIA Rhône-Alpes - INRIA - Computer Science Department [UCLA] - UCLA-CS - University of California, Los Angeles
%X Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols behave in practice and how their operating parameters affect overall system performance. This paper presents the first detailed experimental investigation of the peer selection strategy in the popular BitTorrent protocol. By observing more than 40 nodes in instrumented private torrents, we validate three protocol properties that, though believed to hold, have not been previously demonstrated experimentally: the clustering of similar-bandwidth peers, the effectiveness of BitTorrent's sharing incentives, and the peers' high uplink utilization. In addition, we observe that BitTorrent's modified choking algorithm in seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to absence of peer clustering and less effective sharing incentives. Based on our results, we provide guidelines for seed provisioning by content providers, and discuss a tracker protocol extension that addresses an identified limitation of the protocol.
%G English
%8 2007-06-12
%2 not specified
%B ACM SIGMETRICS'2007
%2 California
%8 2007-06-12
%Z This article is the author version of a paper accepted at ACM SIGMETRICS'2007. In particular, this paper is different from the technical report inria-00112066, version 1 - 21 November 2006. The technical report inria-00112066, version 1 - 21 November 2006 is a extended version of this paper (same title and authors, but different content) Version 2 is the same content as version 1, but with a different class in order to match the camera ready format for SIGMETRICS

Clustering and Sharing Incentives in BitTorrent Systems

Arnaud Legout (

) ¹, Nikitas Liogkas (

)^a^, 2, Eddie Kohler (

)^a^, 2, Lixia Zhang (

)^a^, 2

(2007)

Access to full text
PS
PDF

ACM SIGMETRICS'2007 (2007)

Abstract: Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols behave in practice and how their operating parameters affect overall system performance. This paper presents the first detailed experimental investigation of the peer selection strategy in the popular BitTorrent protocol. By observing more than 40 nodes in instrumented private torrents, we validate three protocol properties that, though believed to hold, have not been previously demonstrated experimentally: the clustering of similar-bandwidth peers, the effectiveness of BitTorrent's sharing incentives, and the peers' high uplink utilization. In addition, we observe that BitTorrent's modified choking algorithm in seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to absence of peer clustering and less effective sharing incentives. Based on our results, 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 Rhône-Alpes)
	INRIA
2:	Computer Science Department [UCLA] (UCLA-CS)
	University of California, Los Angeles

Domain

Computer Science/Networking and Telecommunication

Comment : This article is the author version of a paper accepted at ACM SIGMETRICS'2007. In particular – this paper is different from the technical report inria-00112066 – version 1 - 21 November 2006. The technical report inria-00112066 – version 1 - 21 November 2006 is a extended version of this paper (same title and authors – but different content) Version 2 is the same content as version 1 – but with a different class in order to match the camera ready format for SIGMETRICS

Available versions:

v1 (2007-03-22)

v2 (2007-03-29)


inria-00137444, version 2
http://hal.inria.fr/inria-00137444/en/
oai:hal.inria.fr:inria-00137444_v2
From: Arnaud Legout <>
Submitted on: Wednesday, 28 March 2007 23:08:33
Updated on: Tuesday, 3 April 2007 17:36:09