Hierarchical scheduling algorithm for guaranteeing QoS of delay-sensitive traffic


As the demand for real-time (RT) services increases, service providers need to provide their end-to-end quality of service (QoS). Hence, a hierarchical packet scheduling algorithm is proposed to guarantee a strict QoS requirement of RT traffic in wireless communication systems. The proposed scheduling algorithm gives priority to urgent head-of-line (HOL) RT packets and meets a QoS requirement of RT traffic. Through system-level simulation, the performance of the proposed scheduling algorithm is evaluated in terms of packet drop ratio, packet delay, utilization, service throughput, and over-the-air (OTA) throughput. It is confirmed that the proposed scheduling algorithm yields excellent performance in terms of RT packet drop ratio, RT packet delay, and RT traffic throughput. The proposed hierarchical scheduling algorithm can be utilized to guarantee the strict QoS requirements of delay-sensitive traffic and extended to support the traffic with various delay requirements

DOI: 10.1109/WCNC.2006.1683630

13 Figures and Tables

Cite this paper

@article{Baek2006HierarchicalSA, title={Hierarchical scheduling algorithm for guaranteeing QoS of delay-sensitive traffic}, author={Seon Yeob Baek and Dan Keun Sung}, journal={IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.}, year={2006}, volume={2}, pages={1136-1141} }