Scheduling Algorithm and Bandwidth Allocation in WiMAX

A Survey and Analysis on Scheduling Algorithms in IEEE 802. 16e (WiMAX) Standard

“…In poor radio conditions, the whole process could be repeated up to L times at the end of which, the removed packed is added to the scheduling list, independently of the current radio channel condition. Results show that [13] if we consider latency as a function of rtVR+nrtVR traffic load, the TRS scheduler provides a decrease in the latency.…”

“…This behavior is due to a low threshold assigned for the ertPS class. While the fairness of EDF [13] algorithm is the worst among the (WFQ, WRR, RR, TRS) algorithms. This is due to the fact that some real time packets rtVR connections are dropped under high burstiness, and thus the throughput of rtVR decreases.…”

“…This behavior is indicated by the low average throughput of rtPS and nrtPS SSs, even under high concentration of rtPS and nrtPS SSs. [13]For rtPS QoS class the WRR always maintains almost high fairness, this is due to some real time packets rtVR connections are dropped under high burstiness and thus the throughput of rtVR decreases. [14] WRR does perform well compared to WFQ in queue management and resource utilization since it always maintains almost high fairness.…”

“…[13] This scheduler allows a highly efficient utilization of radio resources. However, with the mSIR scheduler, the users with a SIR (Signal to Interference Ratio) that is always small may never be served.…”

“…In [13], [14], [20] & [21] WRR procedure, packets are categorized into different service classes and then assigned to a queue that can be assigned different percentage of bandwidth and served based on Round Robin order as shown in Figure 4. This algorithm address the problem of starvation by guarantees that all service classes have the ability to access at least some configured amount of network bandwidth.…”