Effective fairness queuing algorithms

In this paper we present two effective fair queuing algorithms (EFQs), which achieves fairness properties and delay properties similar to WFQ (which is currently the better scheduling algorithm among others), and uses a system potential function of O(l) complexity. In EFQs, computation of system potential function does not require any division or multiplication operations such as in minimum delay-self clocked fair queuing (MD-SCFQ). Compared to MD-SCFQ, EFQs have lower complexity and can be easily implemented on chips. We verify the effectiveness of the proposed EFQs through theoretical analysis and give some simulation results.