Asymptotic analysis of proportional fair algorithm

By J. Holtzman. 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598), 2001

326 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/e2778e81864f540a600bc162a039d9ec2ac7a40f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Thomas Bonald
2. Alexandre Proutière
3. P. Whiting
4. Saewoong Bahk
5. Jin-Ghoo Choi
6. Harold J. Kushner
7. Huizhen Yu
8. Francis R. Bach

In Electrical and Electronic Engineering

1. Thomas Bonald
2. Alexandre Proutière
3. P. Whiting
4. Saewoong Bahk
5. Jin-Ghoo Choi
6. Harold J. Kushner

Citations in the corpus

• Convergence of proportional-fair sharing algorithms under general conditions (2004, background): “This fact was also noted in [6], under the special conditions used there.”
• Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment (2007, background): “The PF scheduler strikes a reasonable compromise by allocating an equitable portion of time slots to each user while giving preference to users in the good channel state [14], i.”
• Wireless downlink data channels: user performance and cell dimensioning (2003, background): “In particular, while users are generally assumed to be uniformly distributed in the cell, the location of active users in steady state does depend on the scheduling employed.”