Enhanced WFQ algorithm with (m,k)-firm guarantee

Authors:
Hongxia Yin;Zhi Wang;Youxian Sun
Affiliations:
National Laboratory of Industrial Control Technology, Zhejiang University, China;National Laboratory of Industrial Control Technology, Zhejiang University, China;National Laboratory of Industrial Control Technology, Zhejiang University, China
Venue:
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Year:
2004

Citing 5
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines

IEEE Transactions on Computers
DBP-M: A technique for meeting end-to-end \firm{m}{k} \\ guarantee requirements in point-to-point networks

LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.