An Overview of Packet Reordering in Transmission Control Protocol (TCP): Problems, Solutions, and Challenges
The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract
Transmission control protocol (TCP) is the most popular transport layer protocol for the Internet. Due to various reasons, such as multipath routing, route fluttering, and retransmissions, packets belonging to the same flow may arrive out of order at a destination. Such packet reordering violates the design principles of some traffic control mechanisms in TCP and, thus, poses performance problems. In this paper, we provide a comprehensive and in-depth survey on recent research on packet reordering in TCP. The causes and problems for packet reordering are discussed. Various representative algorithms are examined and compared by computer simulations. The ported program codes and simulation scripts are available for download. Some open questions are discussed to stimulate further research in this area
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
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 · cited 3×
“Persistent and substantial packet reordering often causes some TCP segments to be retransmitted spuriously and unnecessarily, leading to classical congestion collapse [13].”
BackgroundInfluentialSimulation-based comparisons of Tahoe, Reno and SACK TCP
Fall, K., & Floyd, S. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235162 · Cited by 1,148 · cited 4×
“TCP-DCR achieved 10 times more in connection throughput than SACK TCP when more than 5 percent of packets are delayed according to a normal distribution with negligible congestion loss.”
MethodResultInfluentialTCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
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
Cited by
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
ZygOS: Achieving Low Tail Latency for Microsecond-scale Networked Tasks
Prekas, G., Kogias, M., & Bugnion, E. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132780 · Cited by 207
“When TCP sockets are statically assigned to threads, applications can rely on intuitive ordering and concurrency semantics [33].”
BackgroundA Survey on the Contributions of Software-Defined Networking to Traffic Engineering
Mendiola, A., Astorga, J., Jacob, E., & Higuero, M. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2633579 · Cited by 204
“As explained in [54], packet-level multipath routing can entail TCP seg-”
Background
Metadata
- Authors
- Leung, K.-C., Li, V. O. K., & Yang, D.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2007-04
- Volume
- 18
- Issue
- 4
- Pages
- 522-535
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2098909884
- Cited by
- 196
- References
- 33
- FWCI
- 13.40
- 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: An Overview of Packet Reordering in Transmission Control Protocol (TCP): Problems, Solutions, and Challenges. https://app.cochat.ai/papers/10.1109/tpds.2007.1011
- The paper
- Leung, K.-C., Li, V. O. K., & Yang, D. (2007). An Overview of Packet Reordering in Transmission Control Protocol (TCP): Problems, Solutions, and Challenges. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2007.1011
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.