Deficit Round-Robin: A Second Network Calculus Analysis

Performance analysis of Modified Deficit Round Robin schedulers

Deficit Round Robin (DRR) is a scheduling algorithm which provides fair queuing at O(1) complexity. However, due to its round robin structure, its latency properties are not adequate for latency-critical applications, such as voice. For this reason, router manufacturers implement variants of the DRR algorithm which guarantee lower latencies to one (or a subset of) queue(s). In this paper we eva...

Efficient Fair Queuing using Deficit Round Robin

Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n) ), where n is the number of active flows. This is expensive at high speeds. On the other...

Implicit Service Differentiation using Deficit Round Robin

This paper describes and evaluates the performance of a modified deficit round robin scheduler called PDRR (for Priority DRR). In conjunction with per-flow admission control, PDRR allows the realization of implicit service differentiation where streaming and elastic flows are assured adequate performance without the need for explicit class of service marking or resource reservation. We show thr...

Deficit Round Robin Alternated: A New Scheduling Algorithm

This paper proposes a new scheduling algorithm named DRRA (Deficit Round Robin Alternated) that achieves an improvement in the uniform distribution of the output traffic respect to the existent DRR (Deficit Round Robin) algorithm. This work is embraced into a line of research that intends to provide Ethernet users with the quality of service of ATM. To achieve this, an architecture called “Cell...

A Class of Shaped Deficit Round-Robin (SDRR) Schedulers