Packet scheduling algorithm considering both the delay constraint and user throughput in HSDPA

Abstract

This paper proposes a novel packet scheduling algorithm for delay constraint traffic on high speed down link packet access (HSDPA) and also a packet scheduler for this algorithm. In this packet scheduling algorithm, we consider both the delay constraint and the throughput for each traffic class while maximizing the system capacity. Considering the delay constraint and the throughput simultaneously, our method can guarantee different quality of service (QoS) for each traffic class. Finally, in order to demonstrate the performance of our proposed algorithm, we compare our algorithm with the proportional fairness (PF) method and round robin (RR) method by system simulations. Numerical results show that system performance can be significantly improved employing our algorithm compared to that with the PF or RR method.