Weighted fair queuing ( WFQ, engl. " Weighted fair queuing " ) is an algorithm for a network scheduler and a variant of fair queuing.
The primary objective of the weighted fair queuing is also like the fair queuing fair treatment of the sources of the transmission component. Additionally, however, should still be considered the priority of rivers or springs. Some sources namely have a higher priority than others and some require a higher bandwidth data flows than others.
To overcome this drawback, the fair queuing is extended by the property that it also takes into account the priority of rivers. This property leads to the weighted fair queuing. Weighted fair queuing united as it were the characteristics of priority queuing and fair queuing in itself.
Each data flow is assigned a weight. The queues are polled in a round- robin method.
The weighting of a data flow determines the number of bytes to be removed and sent through round-robin method per tick from the queue.
Bandwidth for flow i
Weighting of flow i
Number of flows
Total bandwidth of the line
Bandwidth for flow i = ( (weight of flow i) / ( total weight of all rivers ) ) * ( total bandwidth of the line ).