Abstract:The scheduling algorithms of routers in the Internet are very important to the QoS (Quality of Service) which can be derived by users’ flows. A new scheduling algorithm—Logarithmic Proportional Fair queueing (LPFQ) scheduling algorithm is presented, and its characteristics are discussed using theoretical analysis and simulations. Theoretical analysis and simulation results demonstrate that LPFQ can not only achieve the compromise among fairness, network utility and total delay, but also punish malicious flows and encourage users to use proper end-to-end flow control algorithms.