The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
Open accessAbstract
We use simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation.We investigate the simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link.This work is an extension of our earlier work ([16]), where one-way traffic (i.e., all of the sources are on the same host and all of the destinations are on the other host) was studied.In this paper we investigate the dynamics that results from two-way traffic (in which there are data sources on both hosts).We find that the one-way traffic clustering and loss-synchronization phenomena d~cussed in [16] persist in this new situation, albeit in a slightly modified form.In addition, there are two new phenomena not present in the earlier study:(1) ACK-compression, which is due to the interaction of data and ACK packets and gives rise to rapid fluctuations in queue length, and (2) an out-of-phase queue-synchronization mode, which keeps link utilization less than optimal even in the limit of very large buffers.These phenomena are helpful in understanding results from an earlier study of network oscillations ([19]).
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. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Self-citationCongestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Self-citationCongestion control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
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
Traffic phase effects in packet-switched gateways
Floyd, S., & Jacobson, V. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/122419.122421 · Cited by 335
Congestion Avoidance in Computer Networks with a Connectionless Network Layer
Jain, R. K., Ramakrishnan, K. K., & Chiu, D. M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809094 · Cited by 164
A new architecture for packet switching network protocols
Zhang, L. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 152
Self-citationAnalysis of Random Drop for Gateway Congestion Control
Hashem, E. S. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 130
Cited by
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
UDT: UDP-based data transfer for high-speed wide area networks
Gu, Y., & Grossman, R. L. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.11.009 · Cited by 414
On estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
Metadata
- Authors
- Zhang, L., Shenker, S., & Clark, D. D.
- Venue
- Proceedings of the conference on Communications architecture & protocols
- Publisher
- ACM
- Published
- 1991-08
- Pages
- 133-147
- OpenAlex
- W2096812769
- Cited by
- 375
- References
- 12
- FWCI
- 11.39
- 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: Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic. https://app.cochat.ai/papers/10.1145/115992.116006
- The paper
- Zhang, L., Shenker, S., & Clark, D. D. (1991). Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic. Proceedings of the conference on Communications architecture & protocols. https://doi.org/10.1145/115992.116006
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.
