Prevailing weight-based scheduling algorithms advocate static or coarse-grained simplification of timestamp computation, resulting in performance bottleneck and unnecessary downgrade under heavy and normal computation loads, respectively. Our goal is to design a scheduler that enables quantitative trade-off balance between performance and complexity. In this paper, we propose a Stepwise QoS Scheduler (SQS), enabling packet to burst scheduling under normal to heavy computation loads, based on a new notion of window. Window sizes of unity, and greater than one correspond to packet and burst scheduling, respectively. SQS exerts simple FIFO service within the window and guarantees stepwise weight-proportional service at the window boundary. As a result, quantitative trade-off balance can be facilitated via the adjustment of the window size. We further formally specify the SQS service guarantee for a flow by a stepwise service curve, which is a function of W and θmin - the least-upper-bound delay incurred by the first packet of the busy period of the flow. Finally, we demonstrate through experimental results that, by applying a small window (W ≤ 10), SQS outperforms Weighted Fair Queueing (WFQ) and performs as superior as Worst-case Fair Weighted Fair Queueing (WF2Q) with respect to throughput fairness, mean delay, and worst-case delay fairness.
|頁（從 - 到）||1094-1099|
|期刊||IEEE International Conference on Communications|
|出版狀態||Published - 1 一月 2002|
|事件||2002 International Conference on Communications (ICC 2002) - New York, NY, United States|
持續時間: 28 四月 2002 → 2 五月 2002