Why flow-completion time is the right metric for congestion control
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Users typically want their flows to complete as quickly as possible. This makes Flow Completion Time (FCT) an im portant - arguably the most important - performance metric for the user. Yet research on congestion control focuses almost entirely on maximizing link throughput, utilization and fairness, which matter more to the operator than the user. In this paper we show that with typical Internet flow sizes, existing (TCP Reno) and newly proposed (XCP) congestion control algorithms make flows last much longer than necessary - often by one or two orders of magnitude. In contrast, we show how a new and practical algorithm - RCP (Rate Control Protocol) - enables flows to complete close to the minimum possible
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
Patterson, D. A. (2004) · Communications of the ACM · doi:10.1145/1022594.1022596 · Cited by 238
Cited by
Making middleboxes someone else's problem: network processing as a cloud service
Sherry, J., Hasan, S., Scott, C., Krishnamurthy, A., Ratnasamy, S., & Sekar, V. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342359 · Cited by 621
Reproducible network experiments using container-based emulation
Handigol, N., Heller, B., Jeyakumar, V., Lantz, B., & McKeown, N. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413206 · Cited by 506
Self-citationFinishing flows quickly with preemptive scheduling
Hong, C.-Y., Caesar, M., & Godfrey, P. B. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342389 · Cited by 451
Making middleboxes someone else's problem: network processing as a cloud service
Sherry, J., Hasan, S., Scott, C., Krishnamurthy, A., Ratnasamy, S., & Sekar, V. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2377677.2377680 · Cited by 325
Adaptive forwarding in named data networking
Yi, C., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317319 · Cited by 308
Metadata
- Authors
- Dukkipati, N., & McKeown, N.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2006-01-10
- Volume
- 36
- Issue
- 1
- Pages
- 59-62
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2103830109
- Cited by
- 317
- References
- 2
- FWCI
- 15.38
- Type
- journal article
- 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
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.