[Tmrg] A reminder about An NS2 TCP Evaluation Tool Suite

[Hideyuki Shimonishi]

Hi  Lachlan,

At 07/08/20 07:52 -0700, Lachlan Andrew wrote:
>Greetings Hide,
>
>On 20/08/07, Hideyuki Shimonishi <h-shimonishi at cd.jp.nec.com> wrote:
> >
> > Nice to talk to you again.
>
>Yes, good to hear from you.  I hope you don't mind, but I'm Cc'ing
>this to  tmrg.
>
> > It may be useful to consider distribution of per-flow throughput, rather
> > than some statistical values.
> > Also, in multiple-bottleneck topology, we may have to consider
> > alpha-proportional fairness, i.e. resource fairness v.s. throughput fairness.
>
>Good point.  I was also thinking that it would be good both to
>evaluate the total "utility" based on some sort of  alpha-fairness,
>and also try to evaluate what "alpha" is the best approximation in the
>case of multiple links.

I have no idea what alpha is better or not, but I think it would be 
valuable to study what protocol is more resource-fair than Reno and what 
protocol is more throughput-fair than Reno.

> > Some results are shown in my PFLDnet 2007 presentation.
> > Some results about throughput distribution are shown in pp17-18.
> > Some results about fairness are shown in left figure of page 21, which
> > shows AReno, compound-TCP, and Hamilton-TCP are rather throughput fair, and
> > others are rather resource fair. I do not think this figure is the best, we
> > may need to use another statistics to show this tradeoff.
>
>OK, I'll check out those figures.

Also, please check slide 14. It looks like that AReno and Hamilton have 
similar alpha with Reno, and others are more resource fair.

> > >4. The parking lot topology is very symmetric.  It would be
> > >interesting to look at parking-lot topologies with different
> > >bandwidths on the different bottlenecks.
> >
> > As you may know since Cesar has presented our tool at ICCRG, our NEC-UCLA
> > tool should be one other option to do simulations in complex topologies.
>
>Yes, I saw that presentation.  One feature I really like about that
>tool is the way it compares very systematically against Reno using
>exactly the same traffic.

Thanks. Your comments two years ago about the tool was really helpful to me 
to develop the method !

Thanks,

HIDE



>Cheers,
>Lachlan
>
>--
>Lachlan Andrew  Dept of Computer Science, Caltech
>1200 E California Blvd, Mail Code 256-80, Pasadena CA 91125, USA
>Phone: +1 (626) 395-8820    Fax: +1 (626) 568-3603