The proportional fair sharing algorithm under i.i.d. models

Author

Pugh, Matthew

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA

fYear

2012

Firstpage

508

Lastpage

512

Abstract

The proportional fair sharing (PFS) algorithm has been used in multi-user systems as an attempt to balance fairness and performance of the system throughput. Motivated by the cellular downlink scheduling problem, it is shown that when the rates of each user are i.i.d., the performance of the PFS scheduling algorithms is asymptotically equivalent to a purely greedy scheduling algorithm. The mean asymptotic throughput of the PFS algorithm is characterized and the rate of convergence to this limit is derived under i.i.d. models. Additionally the asymptotic covariance matrix about the convergence point is stated.

Keywords

cellular radio; convergence; covariance matrices; greedy algorithms; multiuser channels; radio links; scheduling; wireless channels; PFS scheduling algorithm; asymptotic covariance matrix; cellular downlink scheduling problem; convergence point; downlink channel; fairness balancing; greedy scheduling algorithm; i.i.d. models; mean asymptotic throughput; multiuser systems; performance balancing; proportional fair sharing algorithm; system throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers (ASILOMAR), 2012 Conference Record of the Forty Sixth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

978-1-4673-5050-1

Type

conf

DOI

10.1109/ACSSC.2012.6489056

Filename

6489056