2006 IEEE International Conference on Communications 2006
DOI: 10.1109/icc.2006.254792
|View full text |Cite
|
Sign up to set email alerts
|

TCP NewReno: Slow-but-Steady or Impatient?

Abstract: In this paper, we compare the throughputs of two different TCP NewReno variants, namely Slow-but-Steady and Impatient. We develop analytic throughput models of these variants as a function of round-trip time, loss event rate, and the burstiness of packet drops within a loss event. Our models build upon prior work on TCP Reno throughput modeling, but extend this work to provide an analytical characterization of the NewReno fast recovery algorithms. We validated our models using the ns-2 simulator. Our models ac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…error bits) other than congestion. The authors in [16] show similar results when TCP New Reno is used and less than 20 packets per congestion window are lost.…”
Section: B Xcp/p-xcp Over Slow-but-steady Tcpmentioning
confidence: 55%
“…error bits) other than congestion. The authors in [16] show similar results when TCP New Reno is used and less than 20 packets per congestion window are lost.…”
Section: B Xcp/p-xcp Over Slow-but-steady Tcpmentioning
confidence: 55%
“…Totally, the FR/FR procedure has 3 RTTs before RTO expires and can recover 3 packets. Hence, if the total number of lost packets in the same window of data is greater than 3, there is an RTO expiration with the Impatient version [50]. Instead, in the Slow-but-Steady case, the FR/FR phase continues slowly recovering 1 packet per RTT without RTO expirations; when the FR/FR phase ends, a congestion avoidance phase starts.…”
Section: Tcp Newrenomentioning
confidence: 99%
“…Stochastic models of congestion window evolution of popular TCP implementations established that the throughput of TCP Reno [6,16,20,21] and its variants such as NewReno [23] is inversely proportional to the product of RTT and square root of packet loss rate. Recently, Samios et al [27] developed a model for TCP Vegas from which throughput can be estimated.…”
Section: Latencymentioning
confidence: 99%