[R-C] Simplifying the TCP throughput algorithm
Colin Perkins
csp at csperkins.org
Thu Mar 29 13:45:25 CEST 2012
On 29 Mar 2012, at 13:38, Stefan Holmer wrote:
> 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.
Agree, but (at least from the measurements I've seen) the estimate won't be too bad.
--
Colin Perkins
http://csperkins.org/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.alvestrand.no/pipermail/rtp-congestion/attachments/20120329/cb1cc9f8/attachment.html>
More information about the Rtp-congestion
mailing list