BitTorrent Protocol and a Modified Secretary Problem
The PUMP Journal of Undergraduate Research · 2019
DOI: 10.46787/pump.v2i0.156 ↗Kurz gefasst
Studienprotokoll in der Zeitschrift The PUMP Journal of Undergraduate Research, 2019. Verfasst von Jay Cummings und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Cummings, J., & Ezaki, J. (2019). BitTorrent Protocol and a Modified Secretary Problem. The PUMP Journal of Undergraduate Research. https://doi.org/10.46787/pump.v2i0.156
Vancouver
Cummings J, Ezaki J. BitTorrent Protocol and a Modified Secretary Problem. The PUMP Journal of Undergraduate Research. 2019. doi:10.46787/pump.v2i0.156
BibTeX
@article{Cummings2019,
author = {Cummings, Jay and Ezaki, Joe},
title = {BitTorrent Protocol and a Modified Secretary Problem},
journal = {The PUMP Journal of Undergraduate Research},
year = {2019},
doi = {10.46787/pump.v2i0.156}
}
EUVIMED