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