Frame-based Worst-Case Weighted Fair Queueing with Jitter Control
Journal
IEICE Transactions on Communications
Journal Volume
E84B
Journal Issue
8
Start Page
2266
End Page
2278
ISSN
0916-8516
1745-1345
Date Issued
2001-08
Author(s)
Abstract
In the past, a number of scheduling algorithms that approximate GPS. such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and minimum bandwidth guarantee. However. with O(log N) computational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithms are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter. In this paper, we propose a new traffic scheduling discipline called Jitter Control Frame-based Queueing (JCFQ) that provides an upper bound for delay jitter in the case of rat e-controlled connections. such as packet video streams and IP telephony, while guaranteeing bounded delay and worst-case fair weighted fairness. such as in the WF(2)Q algorithm, but with O(1) complexity in selecting the next packet to serve, assuming that the number of flows is fixed. Three different algorithms for slot or service order assignment between flows are proposed: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) and Maximum Jitter First In these algorithms, delay, jitter is formulated into the virtual finish time calculation. We. compare the fairness, delay and jitter performance of the JCFQ with that of the MJF algorithm with WF(2)Q via simulation. The results show that with proper choice of the slot size. JCFQ can achieve better flow isolation in delay distribution than call WF(2)Q.
Subjects
Frame-based
Jitter control
Quality of service
Weighted fair queueing
Type
journal article