[R-C] Fairness of RRTCC and TCP

Piers O'Hanlon p.ohanlon at gmail.com
Thu Aug 2 20:14:44 CEST 2012


Hi Varun,

This looks interesting - it would be nice to see self-fairness performance as well. What model did you use for the codec in ns2 (EvalVid or mpeg_traffic or other) ? 

I (and probably others) would be interested to have access to the ns2 RRTCC implementation - would it possible to release the source code? (Though I'd be surprised if Google haven't already implemented it in ns2/3 already as well ...)

Thanks,

Piers


 
On 2 Aug 2012, at 08:47, Varun Singh wrote:

> Hi,
> 
> Following up on the discussion of fairness between interactive
> real-time flows and TCP.
> I've implemented the RRTCC in NS-2 and attached within are the
> preliminary results.
> 
> The scenarios that we simulated are:
> 1. RRTCC flow shares a bottleneck with short TCP.
> 2. two RRTCC flows share a bottleneck with with short TCP flows.
> 
> The short TCP flows are modelled as on/off flows. The size of the data
> is obtained from a uniform distribution between 100KB and 1.5MB, and
> the idle periods are obtained from an exponential distribution with
> the mean as 10.
> 
> The results are available as a short presentation at: http://bit.ly/rrtcc-tcp
> 
> I would appreciate any comments and/or feedback.
> 
> Cheers,
> Varun
> _______________________________________________
> Rtp-congestion mailing list
> Rtp-congestion at alvestrand.no
> http://www.alvestrand.no/mailman/listinfo/rtp-congestion



More information about the Rtp-congestion mailing list