The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
TCP and explicit congestion notification
Open accessAbstract
This paper discusses the use of Explicit Congestion Notification (ECN) mechanisms in the TCP/IP protocol. The first part proposes new guidelines for TCP's response to ECN mechanisms (e.g., Source Quench packets, ECN fields in packet headers). Next, using simulations, we explore the benefits and drawbacks of ECN in TCP/IP networks. Our simulations use RED gateways modified to set an ECN bit in the IP packet header as an indication of congestion, with Reno-style TCP modified to respond to ECN as well as to packet drops as indications of congestion. The simulations show that one advantage of ECN mechanisms is in avoiding unnecessary packet drops, and therefore avoiding unnecessary delay for packets from low-bandwidth delay-sensitive TCP connections. A second advantage of ECN mechanisms is in networks (generally LANs) where the effectiveness of TCP retransmit timers is limited by the coarse granularity of the TCP clock. The paper also discusses some implementation issues concerning specific ECN mechanisms in TCP/IP networks.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Self-citationCongestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Integrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
Link-sharing and resource management models for packet networks
Floyd, S., & Jacobson, V. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.413212 · Cited by 977
Self-citationStevens, W. R. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 756
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
A binary feedback scheme for congestion avoidance in computer networks
Ramakrishnan, K. K., & Jain, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/78952.78955 · Cited by 365
High performance TCP in ANSNET
Villamizar, C., & Song, C. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205520 · Cited by 362
Cited by
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Promoting 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-citationThe BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Kunniyur, S., & Srikant, R. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383069 · Cited by 490
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Metadata
- Authors
- Floyd, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1994-10-20
- Volume
- 24
- Issue
- 5
- Pages
- 8-23
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W1970131865
- Cited by
- 1,016
- References
- 13
- FWCI
- 10.43
- Type
- journal article
- Language
- en
- Open access
- bronze
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: TCP and explicit congestion notification. https://app.cochat.ai/papers/10.1145/205511.205512
- The paper
- Floyd, S. (1994). TCP and explicit congestion notification. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/205511.205512
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.
