Live briefing
Everything about Deficit round robin
Scheduling algorithm for the network scheduler
Deficit round robin (DRR), also deficit-weighted round robin (DWRR), is a scheduling algorithm for the network scheduler. DRR is, similar to weighted fair queueing (WFQ), a packet-based implementation of the ideal generalized processor sharing (GPS) policy. It was proposed by M. Shreedhar and G. Varghese in 1995 as an efficient and fair algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Deficit round robinA 5-minute orientation
- Skim a recent paper: Worst-Case Delay Analysis of Time-Sensitive Networks With Deficit Round-RobinInfluential work since 2022
- Pick up a classic book: Canada the State of the FederationThe most-reprinted book on the subject
- Read the landmark paper: Efficient fair queuing using deficit round-robinCited 991 times
- Go sideways: Weighted fair queueingA closely related topic
- Go sideways: Weighted round robinA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Efficient fair queuing using deficit round-robin
Efficient fair queueing using deficit round robin
Tradeoffs Between Low Complexity, Low Latency, and Fairness With Deficit Round-Robin Schedulers
Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks
Deficit round-robin scheduling for input-queued switches
Deficit Round-Robin: A Second Network Calculus Analysis
Dynamic deficit round-robin scheduling scheme for variable-length packets
Performance analysis of Modified Deficit Round Robin schedulers
🆕 Influential since 2022
📚 Books worth reading
Canada the State of the FederationWatts · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Weighted fair queueing Weighted fair queueing (WFQ) is a network scheduling algorithm. WFQ is both a packet-based implementation of the generalized processor sharing (GPS) policy…
- Weighted round robin Weighted round robin (WRR) is a network scheduler for data flows, but also used to schedule processes. Weighted round robin is a generalisation of round-robin…
- Round-robin scheduling Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known…
- Generalized processor sharing Generalized processor sharing (GPS) is an ideal scheduling algorithm for process schedulers and network schedulers. It is related to the fair-queuing principle…
- Fair queuing Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The algorithm is designed to achieve fairness when a limited…
- Bandwidth management Bandwidth management is the process of measuring and controlling the communications (traffic, packets) on a network link, to avoid filling the link to…
- Scheduling (computing) In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The…
- Leaky bucket The leaky bucket is an algorithm based on an analogy of how a bucket with a constant leak will overflow if either the average rate at which water is poured…