The Stratified Round Robin scheduler: design, analysis and implementation

Authors:
Sriram Ramabhadran;Joseph Pasquale
Affiliations:
Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA;Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2006

Citing 25
Cited 6

The design philosophy of the DARPA internet protocols

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
An upper bound on delay for the VirtualClock service discipline

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

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A schedulability condition for deadline-ordered service disciplines

IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework

IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks

IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service

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

IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
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
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Lottery and stride scheduling: flexible proportional-share resource management

Lottery and stride scheduling: flexible proportional-share resource management
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware-efficient fair queueing architectures for high-speed networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Implementing scheduling algorithms in high-speed networks

IEEE Journal on Selected Areas in Communications

A scalable packet sorting circuit for high-speed WFQ packet scheduling

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Analysis of round-robin variants: favoring newly arrived jobs

SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Bonded deficit round robin scheduling for multi-channel networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Fully hardware based WFQ architecture for high-speed QoS packet scheduling

Integration, the VLSI Journal
Arbitration of many thousand flows at 100G and beyond

Proceedings of the 2013 Interconnection Network Architecture: On-Chip, Multi-Chip
QFQ: efficient packet scheduling with tight guarantees

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.