Bandwidth and latency analysis of modified deficit round robin scheduling algorithms

Authors:
Luciano Lenzini;Enzo Mingozzi;Giovanni Stea
Affiliations:
University of Pisa, Pisa, Italy;University of Pisa, Pisa, Italy;University of Pisa, Pisa, Italy
Venue:
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Year:
2006

Citing 14
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
Carry-over round robin: a simple cell scheduling mechanism for ATM networks

IEEE/ACM Transactions on Networking (TON)
Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS for IP networks
Fair and Efficient Packet Scheduling Using Elastic Round Robin

IEEE Transactions on Parallel and Distributed Systems
A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token Protocol

IEEE Transactions on Computers
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Design and Performance Analysis of the Generalized Timed Token Service Discipline

IEEE Transactions on Computers
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 evaluate the performance of two such variants, both of which are known as Modified Deficit Round Robin, currently implemented in commercial routers. The comparison is carried out analytically, by deriving the latency and bandwidth sharing properties of both algorithms, and by simulation.