For those who might be interested in Little's law
there is a nice paper by John Little on the occasion
of the 50th anniversary of the result.
https://www.informs.org/Blogs/Operations-Research-Forum/Little-s-Law-as-Viewed-on-its-50th-Anniversary
Is there a reason why in cake the quantum cannot be configured to a
different value like in fq_codel?
___
Cake mailing list
Cake@lists.bufferbloat.net
https://lists.bufferbloat.net/listinfo/cake
On Wed, Apr 22, 2020 at 4:48 PM Dave Taht wrote:
> On Wed, Apr 22, 2020 at 2:04 AM Luca Muscariello
> wrote:
> >
> >
> >
> > On Wed, Apr 22, 2020 at 12:44 AM Dave Taht wrote:
> >>
> >> On Tue, Apr 21, 2020 at 3:33 PM Jonathan Morton
>
On Wed, Apr 22, 2020 at 12:44 AM Dave Taht wrote:
> On Tue, Apr 21, 2020 at 3:33 PM Jonathan Morton
> wrote:
> >
> > > On 22 Apr, 2020, at 1:25 am, Thibaut wrote:
> > >
> > > My curiosity is piqued. Can you elaborate on this? What does free.fr
> do?
> >
> > They're a large French ISP. They
Remote attendance is free of charge but you have to register to be able to
access.
https://www.ietf.org/registration/ietf105/remotereg.py
On Wed, Jul 17, 2019 at 3:13 PM Dave Taht wrote:
> IETF 105 runs from July 20-27th in Montreal.
>
> https://datatracker.ietf.org/meeting/105/agenda/
>
>
We have done something like that a year ago in our team in Cisco
for a project that you Dave are aware of but that is out of scope for these
lists.
It is important to have vantage points in residential and enterprise
networks.
Cloud to Cloud never goes to transit and the big Clouds have global
I disagree on the claims that DC switches do not implement anything.
They do, from quite some time now.
https://www.cisco.com/c/en/us/products/collateral/switches/nexus-9000-series-switches/white-paper-c11-738488.html
On Thu, Dec 6, 2018 at 4:19 AM Dave Taht wrote:
> While I strongly agree
and C) you can implement any packet scheduler using a timing wheel using
virtual times.
On Fri, Jul 20, 2018 at 4:09 PM Dave Taht wrote:
>
> https://www.files.netdevconf.org/d/46def75c2ef345809bbe/files/?p=/Evolving%20from%20AFAP%20%E2%80%93%20Teaching%20NICs%20about%20time.pdf
>
> Talking
In my opinion, you should introduce the challenges faced to get to this
point a little bit more.
There has been an historically difficult insertion of packet scheduling in
the Internet.
FQ in the first place has suffered ostracism for a number of reasons, some
acceptable criticism,
some others
I don't think that this feature really hurts TCP.
TCP is robust to that in any case. Even if there is avg RTT increase and
stddev RTT increase.
And, I agree that what is more important is the performance of sparse
flows, which is not affected by this feature.
There is one little thing that might
I think that this discussion is about trying to solve an almost impossible
problem.
When the link is in overload, and this is the case, there is nothing one
can do with flow queuing or AQM.
It is just too late to make something useful.
Overload means that the number of active backlogged flows is
of a sparse flow loses priority because of the quantum. Bad setting, higher
probability, ideal setting 0 probability.
So your formula seems still wrong to me...
On Tue, Apr 17, 2018 at 4:25 PM, Toke Høiland-Jørgensen <t...@toke.dk>
wrote:
> Luca Muscariello <luca.muscarie...@gmail
I'm not sure that the quantum correction factor is correct.
On Tue, Apr 17, 2018 at 2:22 PM, Toke Høiland-Jørgensen
wrote:
> Y via Cake writes:
>
> > From: Y
> > Subject: Re: [Cake] A few puzzling Cake results
> > To:
It is more complex than that. The general formula is the max-min fair-rate.
The formula Toke has provided works only if you have one single sparse flow
s and all the others are bottlenecked at this link.
I.e. the experiment he has reported.
If you have N_s sparse flows and each consumers R_s,i
That is a big mountain to climb
On Thu, Jan 4, 2018 at 5:20 PM, Dave Taht wrote:
>
> Done fixing the home. It's time to fix the rest of the internet. And
> that's not just queue theory but address assignment and routing.
> Here's
> a traceroute from where I sit in Nicaragua
4, 2018 at 7:23 AM, Luca Muscariello
> <luca.muscarie...@gmail.com> wrote:
> > I think the closest scheduler to Cake is this one, if I have to compare:
> >
> > https://team.inria.fr/rap/files/2013/12/KOR05.pdf
>
> Try as I might, at workloads that I've been able to crea
I think the closest scheduler to Cake is this one, if I have to compare:
https://team.inria.fr/rap/files/2013/12/KOR05.pdf
J. Roberts et al. Implicit Service Differentiation using Deficit Round
Robin, In Proc of ITC 2005.
Luca
On Thu, Jan 4, 2018 at 4:01 PM, Jonathan Morton
17 matches
Mail list logo