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

摘要：

Weighted Fair Queuing (WFQ) is one of the most popular scheduling algorithms, and the delay guarantees that WFQ can provide is decided by the bandwidth and the burst size. Thus, the stringent delay requirement of some real-time networked applications with large burst size, such as video transmission is not guaranteed by WFQ scheduler. In order to better serve the above applications, (m,k)-firm guarantee is integrated in QoS architecture. In this paper, 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, fairness and computing complexity of (m,k)-WF2Q are the same as WF2Q.

作者: Hongxia Yin Zhi Wang Youxian Sun Shanbin Li

作者单位: National Laboratory of Industrial Control Technology, Zhejiang University, China

会议类型: 国际会议

会议名称: 首届嵌入式软件与系统国际会议(Proceedings of the First International Conference on Embedded Software and System)

会议地点: 杭州

会议语种:英文

页码: 266-273

在线出版日期: 2004-12-09（万方平台首次上网日期，不代表论文的发表时间）