• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Rarest First and Choke Algorithms Are Enough (2006)

Cached

  • Download as a PDF

Download Links

  • [www.networking.ir]
  • [hal.inria.fr]
  • [hal.archives-ouvertes.fr]
  • [hal.inria.fr]
  • [hal.archives-ouvertes.fr]
  • [arxiv.org]
  • [arxiv.org]
  • [nslab.ee.ntu.edu.tw]
  • [www.eurecom.fr]
  • [hal.inria.fr]
  • [www.imconf.net]
  • [conferences.sigcomm.org]
  • [hal.archives-ouvertes.fr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Arnaud Legout, et al.
Citations:147 - 15 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Legout06rarestfirst,
    author = {Arnaud Legout and et al.},
    title = {Rarest First and Choke Algorithms Are Enough},
    year = {2006}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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.

Keyphrases

choke algorithm enough    rarest first    choke algorithm    peer-to-peer file replication    bittorrent performs    bit level tit-for-tat solution    experimental evaluation    real torrent    peer selection strategy    first algorithm    detailed information    free rider    bittorrent client    efficient peer-to-peer file replication protocol    protocol event    real experiment    mere observation    version foster reciprocation    bittorrent protocol    good efficiency    recent study    different characteristic    new area   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University