Skip to main content
Weighted Fair Queueing (WFQ) is one of the most important
among all scheduling mechanism. Every arrived packet has it’s SN
(Sequence Number), which determines, when packet should be served.
where:
- SN(i) – current SN
- SNprevious(i) – previous SN
- weight(i) – weight assigned to flow
- lengthpacket(i) – packet length
- “i” – flow number
Now we are sure, that packets (with their different sizes) from many
flows are served fairly. None of flows occupies output link more that
it’s configured value.
There are no explicite formula how to count weight and there might be small differences between implementations.
Comments