Microscopic behaviors of TCP loss recovery using lost retransmission detection

As today's networks evolve towards an IP-based integrated network, the role of transmission control protocol (TCP) has been increasing as well. As a well-known issue, the performance of TCP is affected by its loss recovery mechanism that is comprised of two algorithms; fast retransmit and fast recovery. Although retransmission timeout (RTO) caused by multiple packet losses can be avoided by the modified fast recovery algorithm of TCP NewReno or selective acknowledgement (SACK) option, RTO cannot be avoided if a retransmitted packet is lost. To cope with the problem, lost retransmission detection (LRD) has been proposed for each TCP in B. Kim and J. Lee (2004). In this paper, we evaluate the LRD algorithm by tracing TCP sender's behaviors for several scenarios where a retransmitted packet is lost. In addition, we consider the 'conservation of packets' rule to advocate that LRD does not violate fairness with TCP connections that do not support the LRD algorithm.

[1]  Jaiyong Lee,et al.  A simple model for TCP loss recovery performance over wireless networks , 2004, Journal of Communications and Networks.

[2]  Anurag Kumar,et al.  Comparative performance analysis of versions of TCP in a local network with a lossy link , 1998, TNET.

[3]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[4]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[5]  Jaiyong Lee,et al.  Retransmission loss recovery by duplicate acknowledgment counting , 2004, IEEE Communications Letters.

[6]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[7]  Lili Wang,et al.  A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP , 2003, RFC.

[8]  Dongmin Kim,et al.  Lost retransmission detection for TCP SACK , 2004, IEEE Communications Letters.

[9]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[10]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[11]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[12]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[13]  H. T. Kung,et al.  TCP fast recovery strategies: analysis and improvements , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Hari Balakrishnan,et al.  Network Working Group , 1991 .

[15]  Srinivasan Seshan,et al.  TCP behavior of a busy Internet server: analysis and improvements , 1997, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Janey C. Hoe.  Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM 1996.