A new fairness criterion and its realization by using a new scheduling algorithm in the Internet

A new fairness criterion (logarithmic proportional fairness) is introduced in this paper. Under the control of this criterion, the tradeoff among fairness, network utility and total delay can be achieved in the Internet. This paper also presents a new scheduling algorithm-logarithmic proportional fair queueing scheduling algorithm (LPFQ, in short). By using this scheduling algorithm in routers, the logarithmic proportional fairness criterion and punishment to misbehaving flows can be implemented in the Internet. The theoretical analysis and simulation results prove their validity.

[1]  Steven McCanne,et al.  On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[2]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[3]  T. V. Lakshman,et al.  Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing , 1999, IEEE J. Sel. Areas Commun..

[4]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[6]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[7]  Hui Zhang,et al.  Implementing scheduling algorithms in high-speed networks , 1999, IEEE J. Sel. Areas Commun..