BitTorrent Protocol and a Modified Secretary Problem
DOI:
https://doi.org/10.46787/pump.v2i0.156Keywords:
BitTorrent protocol; secretary problemAbstract
BitTorrent is a popular file sharing protocol in which a user downloads a file from a large collection of seeders, each of which has the file. The user downloads from b of these seeders, but repeatedly drops its worst connection and establishes a new one in search of the best b connections. In this paper we model the BitTorrent protocol using a modified secretary problem, and in doing so find precise stopping times for an arbitrary b. We show that every b gives the same success probability, and that this probability asymptotically approaches 1/e.
Downloads
Published
2019-01-08
How to Cite
Cummings, J., & Ezaki, J. (2019). BitTorrent Protocol and a Modified Secretary Problem. The PUMP Journal of Undergraduate Research, 2, 1–19. https://doi.org/10.46787/pump.v2i0.156
Issue
Section
Articles
License
The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.