Retransmission loss recovery by duplicate acknowledgment counting

The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. TCP always evokes RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose an algorithm called duplicate acknowledgment counting (DAC). We use a stochastic model to evaluate the performance of DAC, and compare it with TCP NewReno. Numerical results evaluated by simulations show that DAC can improve TCP loss recovery significantly in presence of random losses.

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

[2]  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.

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

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