Wireless Broadband Network like the standardized IEEE 802.16, popularly referred to as WiMAX is known for its differentiation of Quality-of-Service (QoS) feature based on the traffic requirement. However the QoS differentiation process is often unfair especially to traffic classes which do not require high QoS. Such traffic classes are often starved to the extent that they experience extremely low throughput. In this paper, we look into a scheduling algorithm for providing QoS in Wireless Broadband Networks which alleviates this unfairness. The algorithm implements two queuing theory principles - Earliest Deadline First (EDF) and Weighted Fair Queuing (WFQ) to assure QoS to various classes of traffic. We propose an enhancement to the EDF queuing principle to ensure that lower priority traffic do not starve. We simulated the algorithm in dot net framework using the programming language C#. Our simulation results show considerable improvement in the throughput of low priority traffic while retaining the packet delay constraint of the high priority traffic classes.
[1]
Tzu-Chieh Tsai,et al.
CAC and Packet Scheduling Using Token Bucket for IEEE 802.16 Networks
,
2006,
J. Commun..
[2]
Hossam S. Hassanein,et al.
A performance study of uplink scheduling algorithms in point-to-multipoint WiMAX networks
,
2009,
Comput. Commun..
[3]
Aura Ganz,et al.
Packet scheduling for QoS support in IEEE 802.16 broadband wireless access systems
,
2003,
Int. J. Commun. Syst..
[4]
P. Testa,et al.
Performance analysis of an efficient packet-based IEEE 802.16 MAC supporting adaptive modulation and coding
,
2006,
2006 International Symposium on Computer Networks.
[5]
Yusheng Ji,et al.
A Study on the Performance of Scheduling Schemes for Broadband Wireless Access Networks
,
2006,
2006 International Symposium on Communications and Information Technologies.
[6]
Luciano Lenzini,et al.
Performance Evaluation of the IEEE 802.16 MAC for QoS Support
,
2007,
IEEE Transactions on Mobile Computing.