Frame-Based Worst-Case Weighted Fair Queueing with Jitter Control

摘要

In the past, a number of scheduling algorithms that approximate GPS, such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and min- imum bandwidth guarantee. However, with O(logN) compu- tational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithm are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter.