[R-C] Simplifying the TCP throughput algorithm

[Luca De Cicco]

That formula was derived for TCP NewReno so it's not working properly for
TCP Cubic for instance :). That's why I am not a fan of the TFRC approach.

Cheers,
Luca

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.
>
> Colin
> _______________________________________________
> Rtp-congestion mailing list
> Rtp-congestion at alvestrand.no
> http://www.alvestrand.no/mailman/listinfo/rtp-congestion