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

inria-00112066, version 1

arXiv:cs.NI/0611105

See detailed view

BibTeX EndNote TEI RefWorks

%% inria-00112066, version 1
%% http://hal.inria.fr/inria-00112066/en/
@techreport{LEGOUT:2006:INRIA-00112066:1,
	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. {C}onsequently, it is important to gain a full understanding of how these protocols behave in practice and how their parameters impact overall performance. {W}e present the first experimental investigation of the peer selection strategy of the popular {B}it{T}orrent protocol in an instrumented private torrent. {B}y observing the decisions of more than 40 nodes, we validate three {B}it{T}orrent properties that, though widely believed to hold, have not been demonstrated experimentally. {T}hese include the clustering of similar-bandwidth peers, the effectiveness of {B}it{T}orrent's sharing incentives, and the peers' high average upload utilization. {I}n addition, our results show that {B}it{T}orrent'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. {B}ased 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.},
	keywords = {peer-to-peer; {B}it{T}orrent; choking algorithm; sharing incentives; clustering},
	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 },
	pages = {14 },
	type = {{T}echnical {R}eport},
    year = {2006},
    URL = {http://hal.inria.fr/inria-00112066/en/},
    URL = {http://hal.inria.fr/inria-00112066/PDF/btchoke.pdf},
}

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="report"><head>Research reports</head>
<biblStruct type="report" xml:id="inria-00112066"><monogr>
<author><persName><forename>Arnaud</forename><surname>Legout</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Sophia Antipolis / INRIA Rhône-Alpes</orgName>
<orgName type="team">PLANETE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
</affiliation>
</author>
<author><persName><forename>Nikitas</forename><surname>Liogkas</surname></persName>
<affiliation>
<orgName type="laboratory">UCLA-CS</orgName>
<orgName type="team">Computer Science Department [UCLA]</orgName>
<country>US</country>
<orgName type="institution">University of California, Los Angeles</orgName>
</affiliation>
</author>
<author><persName><forename>Eddie</forename><surname>Kohler</surname></persName>
<affiliation>
<orgName type="laboratory">UCLA-CS</orgName>
<orgName type="team">Computer Science Department [UCLA]</orgName>
<country>US</country>
<orgName type="institution">University of California, Los Angeles</orgName>
</affiliation>
</author>
<author><persName><forename>Lixia</forename><surname>Zhang</surname></persName>
<affiliation>
<orgName type="laboratory">UCLA-CS</orgName>
<orgName type="team">Computer Science Department [UCLA]</orgName>
<country>US</country>
<orgName type="institution">University of California, Los Angeles</orgName>
</affiliation>
</author>
<title type="main" level="m">Clustering and Sharing Incentives in BitTorrent Systems</title><title type="main" level="m">Clustering and Sharing Incentives in BitTorrent Systems</title><imprint><biblScope type="publicationDate">2006</biblScope><biblScope type="pp">14</biblScope></imprint></monogr><idno type="HALid">http://hal.inria.fr/inria-00112066/en/</idno><idno type="HALFile">http://hal.inria.fr/inria-00112066/PDF/btchoke.pdf</idno></biblStruct>
</listBibl>
</listBibl>

Clustering and Sharing Incentives in BitTorrent Systems

Arnaud Legout (

) ¹, Nikitas Liogkas (

)^a^, 2, Eddie Kohler (

)^a^, 2, Lixia Zhang (

)^a^, 2

(2006)

Access to full text
PS
PDF

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 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/en/
oai:hal.inria.fr:inria-00112066_v1
From: Arnaud Legout <>
Submitted on: Tuesday, 21 November 2006 12:44:10
Updated on: Wednesday, 1 October 2008 11:02:01