The Stratified Round Robin Scheduler: Design, Analysis and Implementation

Stratified Round Robin is a fair-queueing packet scheduler which has good fairness and delay properties, and low quasi-O(1) complexity. It is unique among all other schedulers of comparable complexity in that it provides a single packet delay bound that is independent of the number of flows. Importa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2006-12, Vol.14 (6), p.1362-1373
Main Authors: Ramabhadran, S., Pasquale, J.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Analytical models
Bandwidth
Complexity
Delay
Design engineering
Design of experiments
Hardware
High speed
High-speed router design
IP networks
Mathematical analysis
packet scheduling
Packet switched networks
Performance analysis
Quality of service
Queuing
Round robin
Routers
Scheduling
Scheduling algorithm
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Stratified Round Robin is a fair-queueing packet scheduler which has good fairness and delay properties, and low quasi-O(1) complexity. It is unique among all other schedulers of comparable complexity in that it provides a single packet delay bound that is independent of the number of flows. Importantly, it is also amenable to a simple hardware implementation, and thus fills a current gap between scheduling algorithms that have provably good performance and those that are feasible and practical to implement in high-speed routers. We present both analytical results and simulations to demonstrate its performance properties
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2006.886287