Admission control strategy and scheduling algorithms for downlink packet transmission in WCDMA
Muhammad Ali Kazmi, Philippe Godlewski, C. Cordier · 2002
In this paper we investigate the performance of an admission control strategy and two scheduling algorithms for downlink packet transmission in WCDMA. The model incorporates two traffic classes: real-time and non real-time. The admission control strategy is based on mean power and mean traffic load in the target base station. Both scheduling schemes give higher priority to real-time packets. Within a traffic class, one algorithm gives priority to a user having the smallest queue whereas second algorithm prioritizes a user with the largest queue. The performance of the two scheduling algorithms is compared with and without admission control. The performance is evaluated using dynamic simulations. Results are manifested in terms of grade of service, delay, delay-jitter and packet loss rate. The results depict that the smallest queue priority scheduling has a better performance compared to the second algorithm. It is also observed that when input load is high, admission control improves the system performance.