[e2e] TCP Congestion Avoidance

[Ian McDonald]

The most used current paper that I am aware of for Reno is:
http://www.cs.iastate.edu/~cs610/Modeling_TCP_Throughput_Umass.pdf

This is quoted in many RFCs. In particular look at equation 20.

It has been clarified since slightly but I've lost the reference to that paper/

On 2/16/06, Scott Johnson <jsj at ieee.org> wrote:
> I was wondering if there was a feeling among the list members if the
> approximation for TCP throughput developed by Matthew Mathis, Jeffrey
> Semke, and Jamshid Mahdavi in their 1999 (I believe it was 1999) paper
> entitled "The Macroscopic Behavior of the TCP Congestion Avoidance
> Algorithm" is still valid?  I am particulary curious if folks feel that
> it could be approximated as:  throughput <= ~0.7 * MSS / (rtt * sqrt
> (packet_loss)).  This representation came from a paper by Phl Dykstra
> titled Gigabit Ethernet Jumbo Frames (
> http://sd.wareonearth.com/woe/jumbo.html  ).
>
> The topic came up at work and I didn't know if , with the passage of
> time, people still feel it is valid.  I would sincerely appreciate any
> comments.
>
> --
>
>
> Regards,
>
>        Scott Johnson
>
> jsj at ieee.org
>
>


--
Ian McDonald
http://wand.net.nz/~iam4
WAND Network Research Group
Department of Computer Science
University of Waikato
New Zealand