An Analytical Comparison of the Slow-but-Steady and Impatient Variants of TCP New Reno

Authors:
Roman Dunaytsev;Konstantin Avrachenkov;Yevgeni Koucheryavy;Jarmo Harju
Affiliations:
Institute of Communications Engineering, Tampere University of Technology, P.O. Box 553, FIN-33101, Tampere, Finland;INRIA Sophia Antipolis, MAESTRO/MISTRAL Project, 2004, route des Lucioles, B.P. 93, FR-06902, Sophia Antipolis, France;Institute of Communications Engineering, Tampere University of Technology, P.O. Box 553, FIN-33101, Tampere, Finland;Institute of Communications Engineering, Tampere University of Technology, P.O. Box 553, FIN-33101, Tampere, Finland
Venue:
WWIC '07 Proceedings of the 5th international conference on Wired/Wireless Internet Communications
Year:
2007

Citing 6
Cited 0

Modeling TCP Reno performance: a simple model and its empirical validation

IEEE/ACM Transactions on Networking (TON)
Congestion Control in Linux TCP

Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
A Comparison of TCP Automatic Tuning Techniques for Distributed Computing

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Adaptive scalable internet streaming

Adaptive scalable internet streaming
Experimental studies of data transport and data access of earth-science data over networks with high bandwidth delay products

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Networking for the earth science
Measuring the evolution of transport protocols in the internet

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current standard defines two variants of TCP NewReno: the Slow-but-Steady and Impatient. While the behavior of various TCP implementations has been extensively studied over the last years, little attention has been paid to performance analysis of different variants of TCP NewReno. In this paper, we first develop an analytical model of the Impatient variant, which being combined with the earlier proposed model of the Slow-but-Steady variant gives a comprehensive analytical model of TCP NewReno throughput. We then make an analytical comparison of the Impatient and Slow-but-Steady throughputs in the presence of correlated losses. We show that, although neither of the two variants is optimal, the Impatient variant provides the same throughput as the Slow-but-Steady one in a wide range of network conditions and significantly outperforms it in case of large windows and multiple packet drops. This could be of special interest for networks with large bandwidth and long delay.