A weighted fair queuing scheduling algorithm with (m,k)-firm guarantee
Hongxia Yin, Zhi Wang, Youxian Sun · 2005
Some real-time networked applications, such as video transmission, allow a few misses. To better transmit these applications with large burst size or average rate (m, k)-firm guarantee is integrated in QoS architecture. Because WFQ is one of the most popular scheduling algorithms implemented in commercial routers, a weighted fair queuing scheduling algorithm based on (m, k)-firm, (m, k)-WF/sup 2/Q, is proposed. In this paper, a fluid scheduling model, (m, k)-GPS, is proposed firstly. Then, (m, k)-WF/sup 2/Q (a packet-by-packet scheduling algorithm) is showed. Moreover, the worst-case delay bound of (m, k)-WF/sup 2/Q is derived using Network Calculus, and (m, k)-patterns appropriate to (m, k)-WF/sup 2/Q are discussed. Simulation results show that (m, k)-WF/sup 2/Q can provide lower delay than WFQ and (m, k)-WF/sup 2/Q is a fair and feasible queuing scheduling algorithm.