ABSTRACT

In this paper, we propose a fair allocation scheduling algorithm using linear programming, where resource allocation is a function of dynamic queue-sizes of heterogeneous traffic classes and delays of the projected traffic categories. The delay is managed in a manner that the delay-sensitive traffic will be given priority over the delay-tolerant traffic, while still meeting the delay bound and maximum queue size. In this way, the algorithm provides guaranteed QoS to multiple traffic classes. Performance analysis of the algorithm has shown that the proposed packet scheduling scheme achieves significantly better performance compared to other schemes.