On Fri, Jun 12, 2015 at 6:00 AM, Alan Jenkins
wrote:
> On 12/06/15 02:44, David Lang wrote:
>>
>> On Thu, 11 Jun 2015, Sebastian Moeller wrote:
>>
>>>
>>> On Jun 11, 2015, at 03:05 , Alan Jenkins
>>> wrote:
>>>
On 10/06/15 21:54, Sebastian Moeller wrote:
One solution would be if IS
On Thu, Jun 11, 2015 at 6:49 PM, David Lang wrote:
> On Wed, 10 Jun 2015, Daniel Havey wrote:
>
>> We know that (see Kathy and Van's paper) that AQM algorithms only work
>> when they are placed at the slowest queue. However, the AQM is placed
>> at the queue that i
On Thu, Jun 11, 2015 at 12:27 AM, Sebastian Moeller wrote:
> Hi Daniel,
>
> thanks for the clarifications.
>
> On Jun 11, 2015, at 02:10 , Daniel Havey wrote:
>
>> Hmmm, maybe I can help clarify. Bufferbloat occurs in the slowest
>> queue on the path. This i
Hmmm, maybe I can help clarify. Bufferbloat occurs in the slowest
queue on the path. This is because the other queues are faster and
will drain. AQM algorithms work only if they are placed where the
packets pile up (e.g. the slowest queue in the path). This is
documented in Kathy and Van's CoDe
