[R-C] Simplifying the TCP throughput algorithm

[Stefan Holmer]

On Thu, Mar 29, 2012 at 1:22 PM, Colin Perkins <csp at csperkins.org> wrote:

> On 29 Mar 2012, at 13:19, Harald Alvestrand wrote:
> > On 03/29/2012 01:07 PM, Ali C. Begen (abegen) wrote:
> >> I suppose these were random losses?
> > This is just putting numbers into the TCP throughput algorithm from the
> TCP-Friendly RFC using its parameter p, and trying to see what the
> implications of the result are.
> >
> > I presume that p was assumed to be random in the derivation of the
> formula.
>
> It's a loss event rate. The equation gives a conservative value for the
> throughput if the loss is bursty.
>

Which is likely for queues employing tail dropping.


>
> Colin
> _______________________________________________
> Rtp-congestion mailing list
> Rtp-congestion at alvestrand.no
> http://www.alvestrand.no/mailman/listinfo/rtp-congestion
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.alvestrand.no/pipermail/rtp-congestion/attachments/20120329/33419a4c/attachment.html>