[Bloat] What is the best current pseudo-code of the CODEL algorithm.

[Jesper Louis Andersen <jesper.louis.andersen@gmail.com>]

[-- Attachment #1: Type: text/plain, Size: 1009 bytes --]

I am building a load-constraint system, for Erlang, called safetyvalve[1].
Because this system has a concept of a queue I was wondering on applying
some AQM to this queue and CODEL looks like an interesting one to ponder
about. Especially because the algorithm is wonderfully simple. But is the
appendix in the ACM queue article[2] the newest one or does it need some
fixes to work correctly?

Do note that I am aware that CODEL might not fit perfectly without
modifications. But I am still interested in how it works because the
algorithm looks like a very simple way of controlling a given target
latency in a queue. The point with safetyvalve is to be able to define that
a given web server can take, say, 80K connections simultaneously and then
queue excess requests up to a point where a user waits more than 3-4
seconds and then send back an HTTP 503 (Overloaded) if this is the case.

Thanks in advance,

[1] https://github.com/jlouis/safetyvalve
[2] http://queue.acm.org/appendices/codel.html

-- 
J.

[-- Attachment #2: Type: text/html, Size: 1255 bytes --]