Modeling TCP Sack steady state performance in lossy networks

Modeling TCP performance is an important issue which has attracted research over the past two decades. Most literatures are to measure the steady state throughput of TCP Reno, however, few existing literatures are on modeling the throughput of the other important TCP variant, TCP Selective Acknowledgment (Sack). In this paper, an analytic model for the TCP Sack steady state throughput is proposed as a function of round trip time and packet loss rate. The presented model not only captures the behavior of fast recovery mechanism of Sack which is the main difference with Reno but also takes unsuccessful retransmission timeout in consideration. Those results simulated by ns2 show that our model can capture steady state TCP Sack throughput more accurately than existing TCP Sack model.

[1]  kc claffy,et al.  Longitudinal study of Internet traffic in 1998-2003 , 2004 .

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

[3]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2008, RFC.

[4]  Stefan Savage,et al.  Modeling TCP latency , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

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

[7]  Biplab Sikdar,et al.  Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK , 2003, TNET.

[8]  Sven Jaap,et al.  TCP-friendly Rate Control (TFRC) , 2004 .

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

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

[11]  Carey L. Williamson,et al.  An Analytic Throughput Model for TCP NewReno , 2010, IEEE/ACM Transactions on Networking.

[12]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[13]  Qi He,et al.  On the predictability of large transfer TCP throughput , 2005, SIGCOMM '05.

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

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

[16]  Adam Wierman,et al.  A unified framework for modeling TCP-Vegas, TCP-SACK, and TCP-Reno , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..