Low-latency guaranteed-rate scheduling using Elastic Round Robin

Authors:
Salil S. Kanhere;Harish Sethu
Affiliations:
Department of Electrical and Computer Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA;Department of Electrical and Computer Engineering, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA
Venue:
Computer Communications
Year:
2002

Citing 13
Cited 7

Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks—the single node case

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Link-sharing and resource management models for packet networks

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

IEEE/ACM Transactions on Networking (TON)
A reliable and scalable striping protocol

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched 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)
Fair and Efficient Packet Scheduling in Wormhole Networks

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Traffic scheduling in packet-switched networks: analysis, design, and implementation

Traffic scheduling in packet-switched networks: analysis, design, and implementation
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
Performance issues in VC-merge capable switches for multiprotocol label switching

IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics

IEEE Network: The Magazine of Global Internetworking

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
Determination of the parameters in the dynamic weighted round-robin method for network load balancing

Computers and Operations Research
Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation

IEEE Transactions on Parallel and Distributed Systems
Latency-differentiable start-time fair queuing

CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
A novel resource scheduling algorithm for QoS-aware services on the Internet

Computers and Electrical Engineering
Ubiquitous fair bandwidth allocation for multimedia traffic on a WiMAX mesh network with multi-channels

International Journal of Ad Hoc and Ubiquitous Computing
On the latency and fairness characteristics of pre-order deficit round Robin

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia applications. Elastic Round Robin (ERR), a recently proposed fair scheduling discipline designed for best-effort traffic, is very efficient with an O(1) dequeuing complexity and, in addition, has better fairness characteristics than other algorithms of equivalent complexity. In this paper, we analyze ERR for guaranteed-rate services, and obtain an upper bound on its latency. We further show that the bound obtained in this paper is tight. Our analysis shows that ERR, in comparison to other scheduling disciplines of equivalent complexity, also has significantly better latency properties. The combination of fairness, efficiency and low-latency makes ERR an attractive scheduling discipline for both best-effort and guaranteed-rate services.