Performance evaluation of the simplified WFQ to multiplex a huge number of queues

Abstract

Weighted Fair Queuing (WFQ) is a packet scheduling technique allowing guaranteed bandwidth services. However, it is very difficult to implement the WFQ for a lot of queues, because the amount of required calculations for WFQ is proportional to the number of queues. Therefore we proposed the simplified WFQ (SWFQ) mechanism which can support a huge number of queues with guaranteeing the provisioned bandwidth for each queue while it requires fewer amounts of calculations by using approximation techniques. To compare the details of SWFQ and WFQ, a series of simulations are conducted. The result of the simulation shows that SWFQ can guarantee the bandwidth for each queue as same as WFQ and also shows that the difference between WFQ and SWFQ can be negligible when the granularity of the quantization for an approximation is sufficiently fine. In conclusion, these results clarify that SWFQ is an effective mechanism which can provide the same characteristics as WFQ.