A deadline and minimal overhead scheduling algorithm for the WiMax logical scheduler (invited paper)

We present an algorithm for scheduling of packets according to deadline. The algorithm minimizes the total long-run overhead by clustering packets from the same Connection, under the constraint of minimal packet lost. We specify the core algorithm, as well as a number of additional requirements. We outline possible ways of integrating these requirements into the core algorithm. We present some statistical results derived from simulations, and compare the performance of the proposed algorithm to a standard EDF algorithm. We conclude by describing future issues pertaining to the scheduling problem.