Comparisons of packet scheduling methods focusing on throughput of each user in high speed downlink packet access

摘要

This paper compared by computer simulations achievable throughput performance employing fact packet scheduling algorithms focusing on the throughput of each user, i.e., User Throughput, in High-Speed Downlink Packet Access (HSDPA). Three scheduling algorithms were used: Maximum CIR, Proportional Fairness (PF), and Round Robin (RR) methods. Simulation results elucidate that although the Maximum CIR method achieves the higher aggregated User Throughput within a cell than that with PF and RR methods, PF method exhibit the advantage such that it can enhance the User Throughput for the large number of access users with lower received SIR (Signal-to-Interference power Ratio), who are located far from the normalized distance from a cell site of 0.6-0.7 rather than that with Maximum CIR method. It is also shown that the average User Throughput is strongly affected by the total traffic produced within a cell, which is directly depends on the number of access users and the data size per a packet call within a cell.