The CoDel control_law is defined as 't + interval/sqrt(count)'
The sample implementation (http://queue.acm.org/appendices/codel.html) suggests
that sqrt(count) can be calculated using only integer multiplication, but I'm
wondering if it even needs to be calculated.
Would it not be more
The version of codel that cake uses does indeed use such a lookup table for
1..15. This was for accuracy rather than performance reasons.
- Jonathan Morton
___
aqm mailing list
aqm@ietf.org
https://www.ietf.org/mailman/listinfo/aqm
Hello,
A new draft of PIE has been posted. Below are our responses to Bob¹s
questions.
Thanks,
Rong
‹
Response to Bob¹s comments
1) Proposed Standard, but normative language: Done
2) Has PIE been separately tested with and without each enhancement? Yes.
During the DOCSIS-PIE
A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Active Queue Management and Packet Scheduling
Working Group of the IETF.
Title : PIE: A Lightweight Control Scheme To Address the
Bufferbloat Problem
Hi Yuchung, Bob,
(w/o chair hat)
Wouldn't be a sensible reaction, in the scenario sketched by Yuchung, to have
at least one MSS memory available at all times for L4S queues, and drop from
the classic queue if that cann't be guaranteed earlier?
Best regards,
Richard
-Original
As chairs, Richard and I would like to start a 2-week working
group last call on the AQM characterization guidelines:
https://datatracker.ietf.org/doc/draft-ietf-aqm-eval-guidelines/
Please make a review of this, and send comments to the list or
chairs. Any comments that you might have will be
