QoS-based optimal logarithmic-time uplink scheduling algorithm for packets with hard or soft deadlines in WiMAX

We present, for the first time, a formal model for the general problem of uplink scheduling of a set of packets with various QoS classes and soft or hard deadlines. Our goal is to maximize the value of packets to be sent in uplink such that the expectations from the system are guaranteed. We use our general model and the properties of the application to derive an algorithm which has two highly favorable features: it finds the globally optimal solution in logarithmic time. We also present a method to fine-tune our general model. This approach guarantees that the optimal algorithm for the model is indeed the optimal scheduler for the system. Simulation results demonstrate the effectiveness of our algorithms.