Enhanced WFQ Algorithm with (m,k)-Firm Guarantee

Weighted Fair Queuing (WFQ) is a good approximation of Generalized Processor Sharing (GPS) service principle, and can provide the delay guarantee when the bandwidth and the burst size are assured. Thus, WFQ can not satisfy the stringent delay requirement of some real-time networked applications with large burst size, such as video transmission. In order to better serve these applications, (m,k)-firm guarantee is integrated in QoS architecture. A fluid scheduling algorithm, (m,k)-GPS, and its packet approximating scheduling algorithm, (m,k)-WF2Q ,are proposed. Dropping some optional packets, they guarantee low delay to flows with large burst size. Moreover, the fairness and computing complexity of (m,k)-WF2Q are the same as WF2Q.