The improvement of classic PF algorithm

Author

Shi, Wenjie ; Zhang, Yuexia ; Wang, Yuduo

Author_Institution

Sch. of Optoelectron. Inf. & Commun. Eng., Beijing Inf. Sci. & Technol. Univ., Beijing, China

fYear

2011

fDate

26-28 July 2011

Firstpage

855

Lastpage

858

Abstract

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.

Keywords

3G mobile communication; access protocols; MAX C-I algorithms; classic proportional fair algorithm; fairness problems; high speed downlink packet access system; round robin; starving phenomenon; throughput problems; time division HSDPA; Bandwidth; Base stations; Receiving antennas; Scheduling; Systematics; Throughput; Transmitting antennas; PF; TD-HSDPA; mathematical expectation component; scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Technology (ICMT), 2011 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-61284-771-9

Type

conf

DOI

10.1109/ICMT.2011.6001683

Filename

6001683