The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Equation-based congestion control for unicast applications
Open accessAbstract
This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transport protocol, TCP. However, traffic such as best-effort unicast streaming multimedia could find use for a TCP-friendly congestion control mechanism that refrains from reducing the sending rate in half in response to a single packet drop. With our mechanism, the sender explicitly adjusts its sending rate as a function of the measured rate of loss events, where a loss event consists of one or more packets dropped within a single round-trip time. We use both simulations and experiments over the Internet to explore performance.
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
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285291 · Cited by 2,106
Self-citationPromoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Self-citationRecommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
Self-citationRAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet
Rejaie, R., Handley, M., & Estrin, D. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.752152 · Cited by 710
Self-citation
Cited by
Istepanian, R., Philip, N., & Martini, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090517 · Cited by 78
ATL: An Adaptive Transport Layer Suite for Next-Generation Wireless Internet
Akan, O. B., & Akyildiz, I. F. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.826919 · Cited by 75
El Khayat, I., Geurts, P., & Leduc, G. (2010) · Wireless Networks · doi:10.1007/s11276-008-0129-y · Cited by 34
Improving TCP in Wireless Networks with an Adaptive Machine-Learnt Classifier of Packet Loss Causes
El Khayat, I., Geurts, P., & Leduc, G. (2005) · Lecture Notes in Computer Science · doi:10.1007/11422778_44 · Cited by 20
Machine-learnt versus analytical models of TCP throughput
El Khayat, I., Geurts, P., & Leduc, G. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.017 · Cited by 10
Metadata
- Authors
- Floyd, S., Handley, M., Padhye, J., & Widmer, J.
- Venue
- Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
- Publisher
- ACM
- Published
- 2000-08-28
- Pages
- 43-56
- OpenAlex
- W4247796932
- Cited by
- 587
- References
- 5
- FWCI
- 45.97
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Equation-based congestion control for unicast applications. https://app.cochat.ai/papers/10.1145/347059.347397
- The paper
- Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000). Equation-based congestion control for unicast applications. Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. https://doi.org/10.1145/347059.347397
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.
