Abstract
The fairness concept has been widely studied in the area of data networks. The most well-known fairness criterion, max-min fairness, gives priority to the minimum rate session. Kelly questioned its appropriateness in his works on the bandwidth sharing among the end-to-end flows and proposed another fairness criterion preferring short distance flows to enhance the overall throughput, which is called the proportional fairness (PF). A simple scheduler achieving this objective was introduced in wireless access networks and revealed that it can achieve a good compromise between cell throughput and user fairness. Though it has received much attention for some time, research on its performance mainly depended on computer simulations. In this paper, we analyze the PF scheduler to obtain the cell throughput which is a primary performance metric.
Chapter PDF
References
W. Mohr and W. Konhäuser: Access network evolution beyond third generation mobile communications. IEEE Commun. Mag. vol. 38, no. 12 (2000) 122–133
H. Zhang: Service disciplines for guaranteed performance service in packet-switching networks. Proc. IEEE vol. 83, no. 10 (1995) 1374–1396
A. K. Parekh and R. G. Gallager: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Networking vol. 1, no. 3 (1993) 344–357
Y. Cao and Victor O. K. Li: Scheduling algorithms in broad-band wireless networks. Proc. IEEE vol. 89, no. 1 (2001) 76–87
P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushyana, and S. Viterbi: CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users. IEEE Commun. Mag. vol. 38, no. 7 (2000) 70–77
S. Borst and P. Whiting: Dynamic rate control algorithms for HDR throughput optimization, in Proc. IEEE INFOCOM (2001) 976–985
X. Liu, E. K. P. Chong, and N. B. Shroff: Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE J. Select. Areas Commun, vol. 19, no. 10 (2001) 2053–2064
A. Jalali, R. Padovani, and R. Pankaj: Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system, in Proc. IEEE VTC (2000) 1854–1858.
S. Catreux, P. F. Driessen, and L. J. Greenstein: Data throughputs using multiple-input multiple-output (MIMO) techniques in a noise-limited cellular environment. IEEE Trans. Wireless Commun, vol. 1, no. 2 (2002) 226–234
J. M. Holtzman: Asymptotic analysis of proportional fair algorithm, in Proc. IEEE PIMRC (2001) 33–37
A. J. Goldsmith and S.-G Chua: Variable-rate variable-power MQAM for fading channels. IEEE Trans. Commun, vol. 45, no. 10 (1997) 1218–1230
I. S. Gradshteyn and I. M. Ryzhik: Tables of Integrals; Series and Products. 4th ed. New York: Academic (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, JG., Bahk, S. (2004). Cell Throughput Analysis of the Proportional Fair Scheduling Policy. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive