A weighted fair queuing scheduling algorithm with (m, k)-firm guarantee

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.

[1]  Song Wang,et al.  Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks , 2004, Real-Time Systems.

[2]  Mahbub Hassan,et al.  Engineering internet QoS , 2002 .

[3]  Gang Quan,et al.  Enhanced fixed-priority scheduling with (m,k)-firm guarantee , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[4]  Don Towsley,et al.  Theories and models for Internet quality of service , 2002, Proc. IEEE.

[5]  Parameswaran Ramanathan,et al.  Overload Management in Real-Time Control Applications Using (m, k)-Firm Guarantee , 1999, IEEE Trans. Parallel Distributed Syst..

[6]  Kang G. Shin,et al.  Evolution of the Internet QoS and support for soft real-time applications , 2003, Proc. IEEE.

[7]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[8]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[10]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Dennis Shasha,et al.  Skip-Over: algorithms and complexity for overloaded systems that allow skips , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[12]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[13]  P. Ramanathan,et al.  DBP-M: a technique for meeting end-to-end (m, k)-firm guarantee requirement in point-to-point networks , 1997, Proceedings of 22nd Annual Conference on Local Computer Networks.

[14]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.