On making TCP more robust to packet reordering
Abstract
Previous research indicates that packet reordering is not a rare event on some Internet paths. Reordering can cause performance problems for TCP's fast retransmission algorithm, which uses the arrival of duplicate acknowledgments to detect segment loss. Duplicate acknowledgments can be caused by the loss of a segment or by the reordering of segments by the network. In this paper we illustrate the impact of reordering on TCP performance. In addition, we show the performance of a conservative approach to "undo" the congestion control state changes made in conjunction with spurious retransmissions. Finally, we propose several alternatives to dynamically make the fast retransmission algorithm more tolerant of the reordering observed in the network and assess these algorithms.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
TCP throughput for wireless networks can be improved by accurately identifying the cause of packet loss and reducing the TCP transmission rate only when congestion is detected.
“Therefore, the TCP throughput for wireless networks can be improved by accurately identifying the cause of packet loss [34,62,490] and reducing the TCP transmission rate only when congestion is detected.”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [62]
Cites
Congestion avoidance and control
Jacobson, V. L. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,323 · see citing works
Congestion avoidance and control
Jacobson, V. (1988) · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · doi:10.1145/52324.52356 · Cited by 4,650 · see citing works
Postel, J. (1981) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,058 · see citing works
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,647 · see citing works
Simulation-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,150 · see citing works
Wide-area Internet traffic patterns and characteristics
Thompson, K., Miller, G. J., & Wilder, R. (1997) · IEEE Network · doi:10.1109/65.642356 · Cited by 1,076 · see citing works
Computing TCP's Retransmission Timer
Paxson, V., Allman, M. C., Chu, J., & Sargent, M. (2011) · doi:10.17487/rfc6298 · Cited by 826 · see citing works
Self-citationEnd-to-end Internet packet dynamics
Paxson, V. (1997) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) · doi:10.1145/263105.263155 · Cited by 545 · see citing works
Packet 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 403 · see citing works
Ludwig, R., & Katz, R. H. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505688.505692 · Cited by 393 · see citing works
An Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., et al. (2000) · doi:10.17487/rfc2883 · Cited by 371 · see citing works
On estimating end-to-end network path properties
Allman, M. C., & Paxson, V. (1999) · doi:10.1145/316188.316230 · Cited by 344 · see citing works
Self-citationAn integrated congestion management architecture for Internet hosts
Balakrishnan, H., Rahul, H. S., & Seshan, S. (1999) · doi:10.1145/316188.316220 · Cited by 343 · see citing works
Improving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205455 · Cited by 325 · see citing works
Semke, J., Mahdavi, J., & Mathis, M. (1998) · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM) · doi:10.1145/285237.285292 · Cited by 254 · see citing works
Trends in wide area IP traffic patterns - A view from Ames Internet Exchange
McCreary, S., & claffy, K. (2000) · Cited by 252 · see citing works
Enhancing TCP's Loss Recovery Using Limited Transmit
Allman, M. C., Balakrishnan, H., & Floyd, S. (2001) · doi:10.17487/rfc3042 · Cited by 219 · see citing works
Self-citationA web server's view of the transport layer
Allman, M. C. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505672.505674 · Cited by 129 · see citing works
Self-citationImproving round-trip time estimates in reliable transport protocols
Karn, P., & Partridge, C. (1987) · doi:10.1145/55482.55484 · Cited by 83 · see citing works
The Rate-Halving Algorithm for TCP Congestion Control
Semke, J., Mahdavi, J., & Mathis, M. (1999) · Cited by 22 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036 · see citing works
Bayesian packet loss detection for TCP
I'onseca, N., & Crovella, M. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498462 · Cited by 27 · see citing works
- Authors
- Blanton, E., & Allman, M.
- Affiliations
- Ohio University (US)
- BBN Technologies/NASA GRC
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2002-01
- Volume
- 32
- Issue
- 1
- Pages
- 20-30
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W1969809629
- Cited by
- 257
- References
- 20
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 1 · 2020: 1 · 2019: 3 · 2018: 5 · 2017: 10 · 2016: 6 · 2015: 9 · 2014: 8 · 2013: 10 · 2012: 12
- FWCI
- 27.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGCOMM Computer Communication Review (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Traffic and Congestion Control
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Networks and Protocols
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Keywords
- TCP, packet reordering, fast retransmission, duplicate acknowledgments, congestion control
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
