Convergence of proportional-fair sharing algorithms under general conditions

By Harold J. Kushner, P. Whiting. IEEE Transactions on Wireless Communications, 2004

477 citations recorded by the source corpus.

How researchers see this paper

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

Cell Association and Interference Coordination in Heterogeneous LTE-A Cellular Networks (2010, background): “example, [6], [7]), while more practical techniques based on these insights have been studied in, for example [8], [9], [10].”
Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment (2007, background): “Borst and Whiting [6] maximize cell throughput under the constraint that the normalized average throughput for each user is equal, where the normalization factor reflects the users’ required quality of service (QoS).”
UCAN: a unified cellular and ad-hoc network architecture (2003, methodology): “The performance of such HDR scheduling algorithms, including proportional fairness scheduling algorithm, has been analyzed in terms of stability, mean throughput, mean number of active users and mean delay in [10, 9, 21 , 28].”
Performance of digital subscriber line spectrum optimization algorithms (2008, unknown): “When the utility function is the logarithm of the rate, this method is referred to as the proportional fair algorithm [10].”
Dynamic association for load balancing and interference avoidance in multi-cell networks (2007, methodology): “the optimal solution is a slight extension to [17], [18] and is omitted here.”