Logarithmic proportional fair queueing: a new scheducling algorithm

S. Floyd, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Trans.on Networking, 1999, 7(4), 458-472.[2]T.R. Henderson, R. H. Katz, On improving the fairness of TCP congestion avoidance. In Proc.IEEE Globecom98, Sydney, Australia, November 1998, 539-544.C.Albuquerque, T. Suda, B. J. Vickers, Fair queuing with feedback-based policing: Promoting fairness and preventing congestion collapse in the Internet, UCI-ICS Technical report 99-26.University of California, Irvine, USA, September 1998.[3]L. Massoulie.[J].J. Roberts, Bandwidth sharing: objectives and algorithms, In Proc. IEEE Infocom99. New York, USA, March.1395,1999:-[4]郑宝玉,糜正琨,王良元,编著,通信工程中的最优化方法,北京,北京邮电学院出版社,1996,13-19.[5]F.P. Kelly, A. K. Maulloo, D. K. H. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society, 1998,49(1), 237-252.[6]D.C. Stephens, J. C. R. Bennett, H. Zhang, Implementing scheduling algorithms in high-speed net.works, IEEE J. on SAC, 1999, 17(6), 1145-1158.[7]B. Suter, T. V. Lakshman, D. Stiliadis, A. K. Choudhury, Buffer management schemes for supPorting TCP in gigabit routers with per-flow queueing, IEEE J. on SAC, 1999, 17(6), 1159- 1169.