The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Packet reordering is not pathological network behavior
Abstract
It is a widely held belief that packet reordering in the Internet is a pathological behavior, or more precisely, that it is an uncommon behavior caused by incorrect or malfunctioning network components. Some studies of Internet traffic have reported seeing occasional packet reordering events and ascribed these events to "route fluttering", router "pauses" or simply to broken equipment. We have found, however, that parallelism in Internet components and links is causing packet reordering under normal operation and that the incidence of packet reordering appears to be substantially higher than previously reported. More importantly, we observe that in the presence of massive packet reordering transmission control protocol (TCP) performance can be profoundly effected. Perhaps the most disturbing observation about TCP's behavior is that large scale and largely random reordering on the part of the network can lead to self-reinforcingly poor performance from TCP.
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
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Stochastic Modeling and the Theory of Queues
Wolff, R. W. (1989) · Cited by 1,593
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Stevens, W. (1997) · doi:10.17487/rfc2001 · Cited by 1,143
Queueing Systems, Volume 2: Computer Applications
Stern, G., & Kleinrock, L. (1976) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2346953 · Cited by 1,038
TCP Selective Acknowledgment Options
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996) · doi:10.17487/rfc2018 · Cited by 972
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746
End-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Cited by
Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths
Iyengar, J. R., Amer, P. D., & Stewart, R. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.882843 · Cited by 652
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
The Eifel algorithm: making TCP robust against spurious retransmissions
Ludwig, R., & Katz, R. H. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505688.505692 · Cited by 393
Host-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
On making TCP more robust to packet reordering
Blanton, E., & Allman, M. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/510726.510728 · Cited by 257
Metadata
- Authors
- Bennett, J. C. R., Partridge, C., & Shectman, N.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1999
- Volume
- 7
- Issue
- 6
- Pages
- 789-798
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2143663695
- Cited by
- 402
- References
- 10
- FWCI
- 21.36
- 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.