I think this is best explained with an example. It comes up every now and then so I decided to lab it up and show how it works:
In a nutshell, there is a built-in bandwidth policer for the priority queue that prevents it from starving other queues. In this lesson you can see it in action with scenarios where I tested with/without priority queue and with/without congestion. I hope this helps.
Thank you very much for creating this lesson. I really like when a concept that contains a lot of theory is broken down into practical examples like this.
May I know what exactly is the difference between WFQ and CBWFQ? I didn’t find satisfying documentation regarding WFQ online.
From what I’ve read, it’s a type of queuing/scheduling that prioritizes traffic based off flows? How exactly does that work? Are there no classes in classic WFQ?