An Efficient Study of Scheduling Algorithms with Freidman Test in WiMAX Networks
Authors : Mohamed El Amine BRAHMIA (LINEACT), Abdusy Syarif (MIPS), Abdelhafid Abouaissa (MIPS), Lhassane Idoumghar (MIPS), Pascal Lorenz (MIPS)
Article : Articles dans des revues internationales ou nationales avec comité de lecture - 15/12/2014 - Network Protocols and Algorithms
In this paper, we evaluate and compare our scheduling strategy for various IPTV services traffic over 802.16j networks with several scheduling algorithms such as Strict Priority algorithm (SP), Weighted Round Robin (WRR), and Modified Dynamic Weighted Round Robin (MWRR). The proposed scheme adapts dynamically the scheduler operation to according queue load and QoS constraints. In particular, the proposed mechanism gives more priority to HD-TV and SD-TV traffics by using two schedulers. The proposed scheduling algorithm has been simulated using the QualNet network simulator. The Friedman test has been used to address some significant issues of the analysis to compare the proposed scheme with the others scheme. The experimental result and analysis show that the proposed scheduler schemes outperform the traditional scheduling techniques for rtPS traffic that allows ensuring QoS requirements for IPTV application.