The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Packet Switches with Infinite Storage
Abstract
Most prior work on congestion in datagram systems focuses on buffer management. We find it illuminating to consider the case of a packet switch with infinite storage. Such a packet switch can never run out of buffers. It can, however, still become congested. The meaning of congestion in an infinite-storage system is explored. We demonstrate the unexpected result that a datagram network with infinite storage, first-in, first-out queueing, at least two packet switches, and a finite packet lifetime will, under overload, drop all packets. By attacking the problem of congestion for the infinite-storage case, we discover new solutions applicable to switches with finite storage.
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 control in IP/TCP internetworks
Nagle, J. (1984) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1024908.1024910 · Cited by 426
Self-citation
Cited by
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399
McKenney, P. E. (2002) · Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration · doi:10.1109/infcom.1990.91316 · Cited by 273
Metadata
- Authors
- Nagle, J.
- Venue
- IEEE Transactions on Communications
- Published
- 1987
- Volume
- 35
- Issue
- 4
- Pages
- 435-438
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2139150553
- Cited by
- 384
- References
- 1
- FWCI
- 8.52
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Packet Switches with Infinite Storage. https://app.cochat.ai/papers/10.1109/tcom.1987.1096782
- The paper
- Nagle, J. (1987). On Packet Switches with Infinite Storage. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1987.1096782
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.
