The improvement of classic PF algorithm

In the TD-HSDPA system, the PF(Proportional Fair) algorithm was invented to solve the fairness and throughput problems in the RR(Round Robin) and MAX C/I algorithms. Although it can obtain a compromise between RR and MAX C/I, a new type of “starving” phenomenon still happens when a new user enters the system. To solve this issue, we propose a modified algorithm of classic PF to shorten the period been occupied by a new entering user so that other users' resources will be scheduled more fairly. The result shows that the improved algorithm can achieve a more reasonable result in the fairness than the classic one.