By Topic

Hierarchical scheduling algorithm for guaranteeing QoS of delay-sensitive traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Seon Yeob Baek ; Dept. of EECS, KAIST, Daejeon ; Dan Keun Sung

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

Published in:

Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE  (Volume:2 )

Date of Conference:

3-6 April 2006