ACM Home Page
Please provide us with feedback. Feedback
On making TCP more robust to packet reordering
Full text PdfPdf (921 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 32 ,  Issue 1  (January 2002) table of contents
Pages: 20 - 30  
Year of Publication: 2002
ISSN:0146-4833
Authors
Ethan Blanton  Ohio University
Mark Allman  BBN Technologies/NASA GRC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 71,   Citation Count: 30
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/510726.510728
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
{ABF01} Mark Allman, Hari Balakrishnan, and Sally Floyd. Enhancing TCP's Loss Recovery Using Limited Transmit, January 2001. RFC 3042.
2
3
 
4
{APS99} Mark Allman, Vern Paxson, and W. Richard Stevens. TCP Congestion Control, April 1999. RFC 2581.
 
5
6
7
 
8
 
9
{FMMP00} Sally Floyd, Jamshid Mahdavi, Matt Mathis, and Matt Podolsky. An Extension to the Selective Acknowledgement (SACK) Option for TCP, July 2000. RFC 2883.
10
 
11
{JBB92} Van Jacobson, Robert Braden, and David Borman. TCP Extensions for High Performance, May 1992. RFC 1323.
12
13
 
14
{MC00} Sean McCreary and K. Claffy. Trends in Wide Area IP Traffic Patterns A View from Ames Internet Exchange, May 2000. http://www.caida.org/outreach/papers/AIX0005/.
 
15
{MSML99} Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Kevin Lahey. The Rate-Halving Algorithm for TCP Congestion Control, August 1999. Internet-Draft draft-mathis-tcp-ratehalving-00.txt (work in progress).
 
16
{PA00} Vern Paxson and Mark Allman. Computing TCP's Retransmission Timer, November 2000. RFC 2988.
17
 
18
{Pos81} Jon Postel. Transmission Control Protocol, September 1981. RFC 793.
19
 
20
{TMW97} Kevin Thompson, Gregory Miller, and Rick Wilder. Wide-Area Internet Traffic Patterns and Characteristics. IEEE Network, 11(6):10-23, November/December 1997.
 
21
{Tou97} Joe Touch. TCP Control Block Interdependence, April 1997. RFC 2140.

CITED BY  30

Collaborative Colleagues:
Ethan Blanton: colleagues
Mark Allman: colleagues