Weighted fair queuing

Weighted fair queuing ( German  weighted fair queuing , WFQ) is an algorithm for a network scheduler and a variant of fair queuing .

As with fair queuing, the primary goal of weighted fair queuing is fair treatment of the sources of the transmission component. Since some sources have a higher priority than others or some data flows require a higher bandwidth than others, WFQ also takes the priority of sources or flows into account during the queuing process and thus combines the characteristics of priority queuing and fair queuing.

realization

A weighting is assigned to each data flow. The queues are queried in a round robin fashion.

Bandwidth

The weighting of a data flow determines the number of bytes that are taken from the queue and sent per tick in the round robin procedure.

${\displaystyle b_{i}={\frac {w_{i}}{\sum _{j=1}^{n}{w_{j}}}}*R}$

${\displaystyle b_{i}=}$ Bandwidth for flow i

${\displaystyle w_{i}=}$ Weighting of flow i

${\displaystyle n=}$ Number of rivers

${\displaystyle R=}$ Total bandwidth of the line

In words:

Bandwidth for flow i = ((weighting of flow i) / (total weight of all flows)) * (total bandwidth of the line).

See also

• Queuing techniques
• FIFO queuing