Optimal linear-time algorithm for uplink scheduling of packets with hard deadlines in WiMAX

This paper focuses on a recent application of real-time scheduling in wireless communications industry; i.e., uplink scheduling for WiMAX systems. We address the problem of maximizing the number of packets to be sent in uplink such that the expectations from the system are guaranteed. In this work, we present, for the first time, a formal model for the general problem. Then, we use the properties of the application and derive an algorithm which has two highly favorable features: it finds the optimal solution in linear time. Finally, we present a method to fine-tune our general model in order to make sure that the model represents the actual system. This approach guarantees that the optimal algorithm for the model is indeed the optimal scheduler for the system.