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

By J. Padhye, V. Firoiu, D. Towsley, J. Kurose. TNET, 2000

1,286 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

End-to-end performance and fairness in multihop wireless backhaul networks (2004, background): “The model differs from classical max-min fairness [1] as well as proportional fairness as targeted by TCP [18] in that it (i) does not penalize multihop .ows vs. spatial and RTT bias, (ii) achieves fairness at the TAP-aggregate granularity vs. .ow granularity,1 (iii) is temporal fair vs. through”
Extending equation-based congestion control to multicast applications (2001, methodology): “The control equation used by TFRC and TFMCC is derived from a model for long-term TCP throughput in bytes/sec [15]:”
A survey on TCP-friendly congestion control (2001, methodology): “Model-based congestion control uses a TCP model such as the one presented in [2] instead of a TCP-like AIMD mechanism.”
Measuring the quality of experience of HTTP video streaming (2011, methodology): “To estimate the average TCP goodput, we employ the throughput model for a TCP Reno flow [21], given by”
A positive systems model of TCP-like congestion control: asymptotic results (2006, methodology): “[10] provides an approximate expression for the congestion window achieved by a TCP flow.”
Scalable TCP: improving performance in highspeed wide area networks (2003, background): “The traditional TCP response curve [14] can be approximated for small end-to-end drop rates by”