Arnaud Legout, Guillaume Urvoy-Keller, Pietro Michiardi. Rarest first and choke algorithms are enough. In Jussara M. Almeida, Virgílio A. F. Almeida, Paul Barford, editors, Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement 2006, Rio de Janeriro, Brazil, October 25-27, 2006. pages 203-216, ACM, 2006. [doi]
@inproceedings{LegoutUM06,
title = {Rarest first and choke algorithms are enough},
author = {Arnaud Legout and Guillaume Urvoy-Keller and Pietro Michiardi},
year = {2006},
doi = {10.1145/1177080.1177106},
url = {http://doi.acm.org/10.1145/1177080.1177106},
researchr = {https://researchr.org/publication/LegoutUM06},
cites = {0},
citedby = {0},
pages = {203-216},
booktitle = {Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement 2006, Rio de Janeriro, Brazil, October 25-27, 2006},
editor = {Jussara M. Almeida and Virgílio A. F. Almeida and Paul Barford},
publisher = {ACM},
isbn = {1-59593-561-4},
}