A switched scheduling algorithm for congestion relief in WiMAX wireless networks

This paper focuses on improving the scheduling capabilities of the IEEE 802.16-2005 broadband wireless networks, through utilizing multi-queuing algorithms and switching between those queuing algorithms over time to maximize the performance of the WiMAX system. The proposed algorithm aims to improve throughput of high priority traffic in congested networks, without violating the right of lower-priority-traffic to be served in adequate manner. In this work, a detailed simulation study is carried out for the proposed scheduling algorithm as well as comparing its performance with some known algorithms such as Proportional Fairness (PF), Round Robin (RR), and Strict-Priority. Analyses and evaluation of the performance of the scheduler to support the different QoS classes is given as well. The simulation is carried out via the Opnet modeler simulator. The results show the proposed algorithm is capable to handle different users´ requirements under congestion conditions.