[e2e] queue averaging introduces delay

[C.V. Hollot]

i agree with you all, using instantaneous queue is a step in the right 
direction ... there is no need to introduce additional "averaging" in this 
feedback loop ... the dynamics of  AIMD window control and buffer provide 
enough.

kris


>From: "Atiquzzaman, Mohammed" <atiq at ou.edu>
>To: "'Saverio Mascolo'" <mascolo at poliba.it>,
>    Ramakrishna Gummadi
>          <ramki at aciri.org>, end2end-interest at postel.org
>Subject: RE: [e2e] a new paper on Adaptive RED
>Date: Fri, 3 Aug 2001 16:01:29 -0500
> > In my opinion, main reason because RED does not work is that
> > queue average
> > introduces delay for which the discard is no more early as it
> > should be.
>
>
>We have observed a similar effect. To solve the problem we came up with a
>new algorithm which exponentially reduces the average queue length if the
>instantaneous queue length has been low for a certain amount of time. The
>technical report is available at