Weighted deficit earliest departure first scheduling

Abstract

Deficit Round Robin (DRR) and Weighted Deficit Round Robin schedulers have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to provide fairness in terms of waiting time of packets among flows. We propose a new packet scheduling discipline, Weighted Deficit Earliest Departure First scheduler. It provides fairness in terms of throughput and differentiation in average and worst-case queuing time among queues that require different rate and delay guarantees. Simulation shows that it achieves near-perfect throughput fairness that is comparable to DRR scheduler and delay differentiation that is comparable to Earliest Departure First scheduler.