Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay

Authors:
Sriram Ramabhadran;Joseph Pasquale
Affiliations:
University of California, San Diego, La Jolla, CA;University of California, San Diego, La Jolla, CA
Venue:
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Year:
2003

Citing 24
Cited 19

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
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

Reduced state fair queuing for edge and core routers

NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Improving TCP performance over wireless networks with collaborative multi-homed mobile hosts

Proceedings of the 3rd international conference on Mobile systems, applications, and services
Group round robin: improving the fairness and complexity of packet scheduling

Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Frame-Based Proportional Round-Robin

IEEE Transactions on Computers
Localized asynchronous packet scheduling for buffered crossbar switches

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
PRISM: Improving the Performance of Inverse-Multiplexed TCP in Wireless Networks

IEEE Transactions on Mobile Computing
Vertical dimensioning: A novel DRR implementation for efficient fair queueing

Computer Communications
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches

Journal of Parallel and Distributed Computing
Low complexity stable link scheduling for maximizing throughput in wireless networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
On bandwidth tiered service

IEEE/ACM Transactions on Networking (TON)
User-oriented hierarchical bandwidth scheduling for ethernet passive optical networks

Computer Communications
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Asymptotically optimal data dissemination in multichannel wireless sensor networks: single radios suffice

IEEE/ACM Transactions on Networking (TON)
Approximation of generalized processor sharing with interleaved stratified timer wheels

IEEE/ACM Transactions on Networking (TON)
Instant service policy and its application to deficit round robin

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
An improved DRR packet scheduling algorithm based on even service sequence

ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
A hybrid framework of RR scheduler to ensure priority, low complexity and delay with relative fairness

ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Greening wireless communications: Status and future directions

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair queuing is a well-studied problem in modern computer networks. However, there remains a gap between scheduling algorithms that have provably good performance, and those that are feasible and practical to implement in high speed routers. In this paper, we propose a novel packet scheduler called Stratified Round Robin, which has low complexity, and is amenable to a simple hardware implementation. Stratified Robin Robin exhibits good fairness and delay properties that are demonstrated through both analytical results and simulations. In particular, it provides a single packet delay bound that is independent of the number of flows. This property is unique to Stratified Round Robin among all other schedulers of comparable complexity.