Article

Rarest first and choke algorithms are enough

Authors:

G. Urvoy-Keller,

P. MichiardiAuthors Info & Claims

IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

Pages 203 - 216

https://doi.org/10.1145/1177080.1177106

Published: 25 October 2006 Publication History

Abstract

The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rarest first and choke algorithms. Whereas it is commonly admitted that BitTorrent performs well, recent studies have proposed the replacement of the rarest first and choke algorithms in order to improve efficiency and fairness. In this paper, we use results from real experiments to advocate that the replacement of the rarest first and choke algorithms cannot be justified in the context of peer-to-peer file replication in the Internet.We instrumented a BitTorrent client and ran experiments on real torrents with different characteristics. Our experimental evaluation is peer oriented, instead of tracker oriented, which allows us to get detailed information on all exchanged messages and protocol events. We go beyond the mere observation of the good efficiency of both algorithms. We show that the rarest first algorithm guarantees close to ideal diversity of the pieces among peers. In particular, on our experiments, replacing the rarest first algorithm with source or network coding solutions cannot be justified. We also show that the choke algorithm in its latest version fosters reciprocation and is robust to free riders. In particular, the choke algorithm is fair and its replacement with a bit level tit-for-tat solution is not appropriate. Finally, we identify new areas of improvements for efficient peer-to-peer file replication protocols.

References

[1]

http://www.slyck.com.

[2]

http://www.bittorrent.com/.

[3]

Bittorrent protocol specification v1.0. http://wiki.theory.org/BitTorrentSpecification, June 2005.

[4]

R. Bhagwan, S. Savagen, and G. Voelker. Understanding availability. In International Workshop on Peer-to-Peer Systems, Berkeley, CA, USA, February 2003.

[5]

A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analysing and improving bittorrent performance. In Proc. IEEE Infocom'2006, Barcelona, Spain, April 2006.

[6]

E. W. Biersack, P. Rodriguez, and P. Felber. Performance analysis of peer-to-peer networks for file distribution. In Proc. Fifth International Workshop on Quality of Future Internet Services (QofIS'04), Barcelona, Spain, September 2004.

[7]

Y. Chawathe, S. Ratnasamy, L. Breslau, and S. Shenker. Making gnutella-like p2p systems scalable. In Proc. ACM SIGCOMM'03, Karlsruhe, Germany, August 25-29 2003.

Digital Library

[8]

B. Cohen. Incentives build robustness in bittorrent. In Proc. First Workshop on Economics of Peer-to-Peer Systems, Berkeley, USA, June 2003.

[9]

P. Felber and E. W. Biersack. Self-scaling networks for content distribution. In Proc. International Workshop on Self-* Properties in Complex Information Systems, Bertinoro, Italy, May-June 2004.

[10]

P. Ganesan and M. Seshadri. On cooperative content distribution and the price of barter. In IEEE ICDCS'05, Columbus, Ohio, USA, June 2005.

Digital Library

[11]

C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. In Proc. IEEE Infocom'2005, Miami, USA, March 2005.

[12]

K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of dht routing geometry on resilience and proximity. In Proc. ACM SIGCOMM'03, Karlsruhe, Germany, August 25-29 2003.

Digital Library

[13]

L. Guo, S. Chen, Z. Xiao, E. Tan, X. Ding, and X. Zhang. Measurements, analysis, and modeling of bittorrent-like systems. In Proc. ACM IMC'2005, Berkeley, CA, USA, October 2005.

Digital Library

[14]

M. Izal, G. Urvoy-Keller, E. W. Biersack, P. Felber, A. A. Hamra, and L. Garcés-Erice. Dissecting bittorrent: Five months in a torrent's lifetime. In Proc. PAM'04, Antibes Juan-les-Pins, France, April 2004.

[15]

S. Jun and M. Ahamad. Incentives in bittorrent induce free riding. In Proc. SIGCOMM'05 Workshops, Philadelphia, PA, USA, August 2005.

Digital Library

[16]

T. Karagiannis, A. Broido, N. Brownlee, and K. C. Claffy. Is p2p dying or just hiding? In Proc. IEEE Globecom'04, Dalla, Texas, USA, Nov. 29-Dec. 3 2004.

[17]

T. Karagiannis, A. Broido, M. Faloutsos, and K. C. Claffy. Transport layer identification of p2p traffic. In Proc. ACM IMC'04, Taormina, Sicily, Italy, October 2004.

Digital Library

[18]

D. Kostić, R. Braud, C. Killian, E. Vandekieft, J. W. Anderson, A. C. Snoeren, and A. Vahdat. Maintaining high bandwidth under dynamic network conditions. In Proc. USENIX'05, Anaheim, CA, USA, April 2005.

Digital Library

[19]

A. Legout, G. Urvoy-Keller, and P. Michiardi. Rarest first and choke algorithms are enough. Technical Report (inria-00001111, version 3 - 6 September 2006), INRIA, Sophia Antipolis, September 2006.

Digital Library

[20]

A. Parker. The true picture of peer-to-peer filesharing. http://www.cachelogic.com/, July 2004.

[21]

J. A. Pouwelse, P. Garbacki, D. H. J. Epema, and H. J. Sips. The bittorrent p2p file-sharing system: Measurements and analysis. In Proc. 4th International Workshop on Peer-to-Peer Systems (IPTPS'05), Ithaca, New York, USA, February 2005.

Digital Library

[22]

D. Qiu and R. Srikant. Modeling and performance analysis of bittorrent-like peer-to-peer networks. In Proc. ACM SIGCOMM'04, Portland, Oregon, USA, Aug. 30-Sept. 3 2004.

Digital Library

[23]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM'01, San Diego, California, USA, August 27-31 2001.

Digital Library

[24]

P. Rodriguez and E. W. Biersack. Dynamic parallel-access to replicated content in the internet. IEEEACM Transactions on Networking, 10(4), August 2002.

Digital Library

[25]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM'01, San Diego, California, USA, August 27-31 2001.

Digital Library

[26]

X. Yang and G. de Veciana. Service capacity in peer-to-peer networks. In Proc. IEEE Infocom'04, pages 1--11, Hong Kong, China, March 2004.

Cited By

Rodrigues CRocha V(2024)Fine Tuning of the BitCover Algorithm for Interactive VoD Streaming over 5G Cellular NetworksJournal of Internet Services and Applications10.5753/jisa.2024.401015:1(83-102)Online publication date: 28-Jun-2024
https://doi.org/10.5753/jisa.2024.4010
Khan NMoharrami MSubramanian V(2024)Rarest-First With Probabilistic-Mode-Suppression (RFwPMS)IEEE Transactions on Information Theory10.1109/TIT.2024.336000570:4(2936-2966)Online publication date: Apr-2024
https://doi.org/10.1109/TIT.2024.3360005
Rocha VRodrigues C(2023)BitCover: Enhanced BitTorrent for interactive VoD streaming over 5G and WiFi-DirectAd Hoc Networks10.1016/j.adhoc.2022.103040140(103040)Online publication date: Mar-2023
https://doi.org/10.1016/j.adhoc.2022.103040
Show More Cited By

Index Terms

Rarest first and choke algorithms are enough

Recommendations

Understanding churn in peer-to-peer networks
IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requires precise and unbiased information about the arrival and departure of ...
Poster: Destabilizing BitTorrent's clusters to attack high bandwidth leechers
CCS '11: Proceedings of the 18th ACM conference on Computer and communications security

BitTorrent protocol incentivizes sharing through its choking algorithm. BitTorrent choking algorithm creates clusters of leechers with similar upload capacity to achieve higher overall transfer rates. We show that a malicious peer can exploit BitTorrent'...
FairTorrent: bringing fairness to peer-to-peer systems
CoNEXT '09: Proceedings of the 5th international conference on Emerging networking experiments and technologies

Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload bandwidth while consuming much download bandwidth. Previous attempts to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement

October 2006

356 pages

ISBN:1595935614

DOI:10.1145/1177080

General Chairs:
Jussara Almeida
Federal University of Minas Gerais, Brazil
,
Virgilio Almeida
Federal University of Minas Gerais, Brazil
,
Program Chair:
Paul Barford
University of Wisconsin -- Madison, USA

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

IMC06

Sponsor:

IMC06: Internet Measurement Conference

October 25 - 27, 2006

Rio de Janeriro, Brazil

Acceptance Rates

Overall Acceptance Rate 277 of 1,083 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

273
Total Citations
View Citations
1,234
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)2

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Rodrigues CRocha V(2024)Fine Tuning of the BitCover Algorithm for Interactive VoD Streaming over 5G Cellular NetworksJournal of Internet Services and Applications10.5753/jisa.2024.401015:1(83-102)Online publication date: 28-Jun-2024
https://doi.org/10.5753/jisa.2024.4010
Khan NMoharrami MSubramanian V(2024)Rarest-First With Probabilistic-Mode-Suppression (RFwPMS)IEEE Transactions on Information Theory10.1109/TIT.2024.336000570:4(2936-2966)Online publication date: Apr-2024
https://doi.org/10.1109/TIT.2024.3360005
Rocha VRodrigues C(2023)BitCover: Enhanced BitTorrent for interactive VoD streaming over 5G and WiFi-DirectAd Hoc Networks10.1016/j.adhoc.2022.103040140(103040)Online publication date: Mar-2023
https://doi.org/10.1016/j.adhoc.2022.103040
Wu CHo J(2022)Time-Critical Data Dissemination Under Flash Crowd TrafficIEEE Open Journal of the Computer Society10.1109/OJCS.2022.31494113(11-22)Online publication date: 2022
https://doi.org/10.1109/OJCS.2022.3149411
FUJITA S(2021)Semi-Structured BitTorrent Protocol with Application to Efficient P2P Video StreamingIEICE Transactions on Information and Systems10.1587/transinf.2021EDP7011E104.D:10(1624-1631)Online publication date: 1-Oct-2021
https://doi.org/10.1587/transinf.2021EDP7011
Malak DMedard MAndrews J(2021)Spatial Concentration of Caching in Wireless Heterogeneous NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2021.304981220:6(3397-3414)Online publication date: Jun-2021
https://doi.org/10.1109/TWC.2021.3049812
Shiau SHuang YTsai YSun CYen CHuang C(2021)A BitTorrent Mechanism-Based Solution for Massive System DeploymentIEEE Access10.1109/ACCESS.2021.30525259(21043-21058)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3052525
Khan NMoharrami MSubramanian V(2020)Stable and Efficient Piece-Selection in Multiple Swarm BitTorrent-like Peer-to-Peer NetworksIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155253(1153-1162)Online publication date: Jul-2020
https://doi.org/10.1109/INFOCOM41043.2020.9155253
Arbabi MShajari M(2019)Decentralized and secure delivery network of IoT update files based on ethereum smart contracts and blockchain technologyProceedings of the 29th Annual International Conference on Computer Science and Software Engineering10.5555/3370272.3370284(110-119)Online publication date: 4-Nov-2019
https://dl.acm.org/doi/10.5555/3370272.3370284
Shiau SHuang YYen CTsai YSun CJuang JHuang CHuang CHuang S(2019)A Novel Massive Deployment Solution Based on the Peer-to-Peer ProtocolApplied Sciences10.3390/app90202969:2(296)Online publication date: 15-Jan-2019
https://doi.org/10.3390/app9020296
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents