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
Computing TCP's Retransmission Timer
Paxson, V., Allman, M., Chu, J., & Sargent, M. (2011) · doi:10.17487/rfc6298 · Cited by 825
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746 · cited 1×
“A source uses the TCP timestamp option [ 18 ] to insert the current timestamp into the header of each outgoing segment to a destination.”
MethodThe design philosophy of the DARPA internet protocols
Clark, D. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52336 · Cited by 655 · cited 1×
“such as multipath routing, route fluttering, and retransmissions, packets belonging to the same flow may arrive out of order at a destination.”
BackgroundTCP Veno: TCP enhancement for transmission over wireless access networks
Fu, C. P., & Liew, S. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.807336 · Cited by 536 · cited 1×
“There have been some research in enhancing TCP for such noncongestion wireless loss [29], [34], [35], [36], [37], [38].”
BackgroundATCP: TCP for mobile ad hoc networks
Liu, J., & Singh, S. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.932698 · Cited by 504 · cited 1×
“There have been some research in enhancing TCP for such noncongestion wireless loss [29], [34], [35], [36], [37], [38].”
BackgroundFreeze-TCP: a true end-to-end TCP enhancement mechanism for mobile environments
Goff, T., Moronski, J., Phatak, D. S., & Gupta, V. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832552 · Cited by 483
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Casetti, C., Gerla, M., Mascolo, S., Sanadidi, M. Y., & Wang, R. (2002) · Wireless Networks · doi:10.1023/a:1016590112381 · Cited by 421 · cited 1×
“There have been some research in enhancing TCP for such noncongestion wireless loss [29], [34], [35], [36], [37], [38].”
BackgroundPacket reordering is not pathological network behavior
Bennett, J. C. R., Partridge, C., & Shectman, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811445 · Cited by 402
Computing TCP's Retransmission Timer
Paxson, V., & Allman, M. (2000) · doi:10.17487/rfc2988 · Cited by 399 · cited 1×
“The retransmission timeout period (RTO) is determined by the sum of the smoothed exponentially weighted moving average and a multiple of the mean deviation of RTT [4].”
MethodThe 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 · cited 4×
“Wang and Zhang developed TCP with detection of out-oforder and response (TCP-DOOR) [19], which can be considered as an extension of [17].”
BackgroundMethodInfluentialAn Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., & Podolsky, M. (2000) · doi:10.17487/rfc2883 · Cited by 370 · cited 4×
“By suspending the congestion response for a certain time period instead of initiating state recovery upon detecting a spurious fast retransmission, TCP-DOOR [19] outperforms DSACK TCP [20], the Eifel algorithm [17], and SACK TCP [27] by at least 89.”
BackgroundMethodInfluentialOn 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 · cited 14×
“Blanton and Allman developed the time-delayed fast retransmit algorithm [22], denoted as Blanton-Allman:DEL, to postpone congestion response with the presence of forward-path reordering.”
BackgroundMethodResultInfluentialImproving TCP performance over mobile ad-hoc networks with out-of-order detection and response
Wang, F., & Zhang, Y. (2002) · Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/513800.513827 · Cited by 228 · cited 3×
“Wang and Zhang developed TCP with detection of out-oforder and response (TCP-DOOR) [19], which can be considered as an extension of [17].”
BackgroundMethodEnhancing TCP's Loss Recovery Using Limited Transmit
Allman, M., Balakrishnan, H., & Floyd, S. (2001) · doi:10.17487/rfc3042 · Cited by 218 · cited 2×
“The authors also extended the limited transmit algorithm [26], which allows a source to send a new segment upon the receipt of the first two duplicate ACKs, so that a new segment could be sent on every two duplicate ACKs received afterward.”
BackgroundRR-TCP: a reordering-robust TCP with DSACK
Zhang, M., Karp, B., Floyd, S., & Peterson, L. (2004) · 11th IEEE International Conference on Network Protocols, 2003. Proceedings. · doi:10.1109/icnp.2003.1249760 · Cited by 192 · cited 11×
“When compared with RR-TCP, the Leung-Ma algorithm achieved similar performance in terms of connection throughput and unnecessary fast retransmissions, but it takes much fewer computations and storage space.”
BackgroundMethodInfluentialImproving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1991) · ACM Transactions on Computer Systems · doi:10.1145/118544.118549 · Cited by 179 · cited 2×
“Instead of skipping the samples for retransmitted segments in the Karn’s algorithm [15], an RTT sample is taken for each retransmitted segment by taking it as the average of the RTTs for both the first and the second transmissions of that segment.”
BackgroundMethodProbability and Statistics in Engineering and Management Science
Narayanan, A. (1993) · Technometrics · doi:10.1080/00401706.1993.10485069 · Cited by 166
The effect of packet reordering in a backbone link on application throughput
Laor, M., & Gendel, L. (2002) · IEEE Network · doi:10.1109/mnet.2002.1035115 · Cited by 138 · cited 1×
“This can result in a substantial degradation in application throughput and network performance [7].”
BackgroundA new TCP for persistent packet reordering
Bohacek, S. K., Hespanha, J. P., Lee, J., Lim, C.-K., & Obraczka, K. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.873366 · Cited by 92 · cited 2×
“Except for TCP-PR [30], the goodput generally drops as increases from 0 to 2.”
Background"De-Randomizing" congestion losses to improve TCP performance over wired-wireless networks
Biaz, S., & Vaidya, N. H. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.850205 · Cited by 72
TCP-DCR: Making TCP Robust to Non-congestion Events
Bhandarkar, S., & Reddy, A. L. N. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24693-0_59 · Cited by 36 · cited 6×
“Bhandarkar and Reddy devised the delayed congestion response TCP (TCP-DCR) [29] to meliorate the TCP robustness to noncongestion events.”
BackgroundMethodInfluentialImproving the Performance of TCP in the Case of Packet Reordering
Sathiaseelan, A., & Radzik, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25969-5_6 · Cited by 16
Enhancing TCP performance to persistent packet reordering
Leung, K.-C., & Ma, C. (2005) · Journal of Communications and Networks · doi:10.1109/jcn.2005.6389822 · Cited by 14 · cited 4×
“The Blanton-Allman algorithm [22], RR-TCP [16], and the Leung-Ma Algorithm [23], have adopted this technique for detection of forward-path reordering and state reconciliation.”
MethodInfluentialSelf-citation
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
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.