DocumentCode :
379406
Title :
A QoS packet/burst scheduler for broadband networks
Author :
Yuang, Maria C. ; Shih, Julin ; Tien, Po-Lung
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
Volume :
2
fYear :
2002
fDate :
2002
Firstpage :
1094
Abstract :
Prevailing weight-based scheduling algorithms advocate static or coarse-grained simplification of timestamp computation, resulting in performance bottlenecks and unnecessary downgrades 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.
Keywords :
broadband networks; packet switching; quality of service; queueing theory; scheduling; FIFO service; QoS packet/burst scheduler; SQS; broadband networks; burst scheduling; busy period; complexity; least-upper-bound delay; mean delay; packet scheduling; packet to burst scheduling; stepwise QoS scheduler; stepwise service curve; stepwise weight-proportional service; throughput fairness; window sizes; worst-case delay fairness; Broadband communication; Computational complexity; Computer science; Delay; Global Positioning System; Jitter; Processor scheduling; Quality of service; Scheduling algorithm; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN :
0-7803-7400-2
Type :
conf
DOI :
10.1109/ICC.2002.997021
Filename :
997021
Link To Document :
بازگشت