On making TCP more robust to packet reordering
- 1 January 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 32 (1), 20-30
- https://doi.org/10.1145/510726.510728
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.Keywords
This publication has 17 references indexed in Scilit:
- Enhancing TCP's Loss Recovery Using Limited TransmitPublished by RFC Editor ,2001
- A web server's view of the transport layerACM SIGCOMM Computer Communication Review, 2000
- Packet reordering is not pathological network behaviorIEEE/ACM Transactions on Networking, 1999
- On estimating end-to-end network path propertiesPublished by Association for Computing Machinery (ACM) ,1999
- An integrated congestion management architecture for Internet hostsPublished by Association for Computing Machinery (ACM) ,1999
- TCP Congestion ControlPublished by RFC Editor ,1999
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- Simulation-based comparisons of Tahoe, Reno and SACK TCPACM SIGCOMM Computer Communication Review, 1996
- TCP Extensions for High PerformancePublished by RFC Editor ,1992
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988