Eligible Start-Time Fair Queuing: A New Fair Queuing Policy and its Analysis with a Stochastic Comparison Approach

We present a new Fair Queuing policy adapted to low-bandwidth flows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processos Sharing PGPS and its version Worst-case Fair, Fair Queuing WF2Q which eliminates discrepancy, the proposed scheduling algorithm is computationally efficient hence feasible for high speed broadband networks. The ESFQ scheduler uses like WF2Q an eligibility criterion to select packets to be transmitted, and like Start-time Fair Queuing SFQ, it uses a Virtual Time based on Virtual Start tags.