CAKE is pretty modern. You can also read the original algorithm proposed to solve the problem, CoDel [0]. The article doesn't quite go into details of how to un

CAKE is pretty modern. You can also read the original algorithm proposed to solve the problem, CoDel [0]. The article doesn't quite go into details of how to unbloat the buffers. So this is still worth a read. The TL;DR is that there are good queues and bad queues that we must distinguish, and that to distinguish them it is not a good idea to use queue length, but rather the recently experienced minimum time for a packet to spend in a queue. I find this very insightful. [0]: https://datatracker.ietf.org/doc/html/rfc8289 https://datatracker.ietf.org/doc/html/rfc8289