By Topic

Adaptive Hierarchical Weighted Fair Queueing scheduling algorithm for WiMAX

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
$33 $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

3 Author(s)
Waleed K. Al-Ghanem ; Coll. of Comput. & Inf. Sci., King Saud Univ., Riyadh, Saudi Arabia ; Mohammad Ilyas ; Imad Mahgoub

In this paper we propose Adaptive Hierarchical Weighted Fair Queuing scheduling algorithm for WiMAX networks. We compare the performance of the proposed algorithm with the Weighted Fair Queuing scheduling algorithm. Comparison is done by simulating the traffic in a WIMAX network and by measuring Quality of Service aspects. Simulation results indicate that the proposed scheduling algorithm has better QoS aspects with all traffic loads.

Published in:

High Capacity Optical Networks and Emerging/Enabling Technologies

Date of Conference:

12-14 Dec. 2012