A Temporal Round Robin Scheduler

In this paper, we present a temporal round robin (TRR) packet scheduler. In default round robin (RR) scheduler, flows are scheduled in sequence one by one without prioritizing any flows assigning the same amount of time slots. The main idea in the proposed TRR is to exploit the temporal variations of a pre-defined utility argument (e.g. SINR or MCS in the context of cellular radio systems) while assigning the same amount of time slots to each flows. It´s shown that the expected value of the utility argument of the scheduled flows in TRR case is equal to or greater than that of the traditional RR. In the context of the cellular radio networks, this translates into an equal or higher network throughput as compared to the traditional RR. The proposed scheduler algorithm can be easily implemented into many various cellular networks including WiMAX. Simple simulation results confirms the effectiveness of the algorithm.