The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Clustering and sharing incentives in BitTorrent systems
Abstract
Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols behave in practice and how their operating parameters affect overall system performance. This paper presents the first detailed experimental investigation of the peer selection strategy in the popular BitTorrent protocol. By observing more than 40 nodes in instrumented private torrents, we validate three protocol properties that, though believed to hold, have not been previously demonstrated experimentally: the clustering of similar-bandwidth peers, the effectiveness of BitTorrent's sharing incentives, and the peers' high uplink utilization. In addition, we observe that BitTorrent's modified choking algorithmin seed state provides uniform service to all peers, and that an underprovisioned initial seed leads to absence of peer clustering and less effective sharing incentives. Based on our results, we provide guidelines for seed provisioning by content providers, and discuss a tracker protocol extension that addresses an identified limitation of the protocol.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Incentives Build Robustness in Bit-Torrent
Cohen, B. (2003) · Cited by 2,677
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Qiu, D., & Srikant, R. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015508 · Cited by 1,201
The Bittorrent P2P File-Sharing System: Measurements and Analysis
Pouwelse, J., Garbacki, P., Epema, D., & Sips, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11558989_19 · Cited by 760
Karagiannis, T., Broido, A., Brownlee, N., Claffy, K. C., & Faloutsos, M. (2005) · IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. · doi:10.1109/glocom.2004.1378239 · Cited by 504
Dissecting BitTorrent: Five Months in a Torrent’s Lifetime
Izal, M., Urvoy-Keller, G., Biersack, E. W., Felber, P. A., Hamra, A. A., & Garcés-Erice, L. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24668-8_1 · Cited by 485
Analyzing and Improving a BitTorrent Networks Performance Mechanisms
Bharambe, A. R., Herley, C., & Padmanabhan, V. N. (2006) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2006.328 · Cited by 454
Do incentives build robustness in bit torrent
Piatek, M., Isdal, T., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2007) · Cited by 377
Measurements, Analysis, and Modeling of BitTorrent-like Systems
Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., & Zhang, X. (2005) · Cited by 369
Rarest first and choke algorithms are enough
Legout, A., Urvoy-Keller, G., & Michiardi, P. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177106 · Cited by 351
Self-citationFree Riding in BitTorrent is Cheap.
Locher, T., Moor, P., Schmid, S., & Wattenhofer, R. P. (2006) · Cited by 246
Cited by
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
Open Problems in Cooperative AI
Dafoe, A., Hughes, E., Bachrach, Y., Collins, T., McKee, K. R., Leibo, J. Z., Larson, K., & Graepel, T. (2020) · arXiv · doi:10.48550/arxiv.2012.08630 · Cited by 93
Metadata
- Authors
- Legout, A., Liogkas, N., Kohler, E., & Zhang, L.
- Venue
- Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2007-06-12
- Pages
- 301-312
- OpenAlex
- W2171076347
- Cited by
- 258
- References
- 16
- FWCI
- 24.60
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Clustering and sharing incentives in BitTorrent systems. https://app.cochat.ai/papers/10.1145/1254882.1254919
- The paper
- Legout, A., Liogkas, N., Kohler, E., & Zhang, L. (2007). Clustering and sharing incentives in BitTorrent systems. Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. https://doi.org/10.1145/1254882.1254919
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.