Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches
IEEE Transactions on Computers
Meiko CS-2 interconnect Elan-Elite design
Parallel Computing - Special double issue: SUPRENUM and GENESIS
The SP2 high-performance switch
IBM Systems Journal
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
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
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)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
IBM RS/6000 SP Interconnection Network Topologies for Large Systems
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
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
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Multi-tiered distributed computing platform
PPPJ '03 Proceedings of the 2nd international conference on Principles and practice of programming in Java
Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels
Journal of Parallel and Distributed Computing
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
WRR-SCAN: a rate-based real-time disk-scheduling algorithm
Proceedings of the 4th ACM international conference on Embedded software
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
Computers and Operations Research
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
A QoS-Tunable Scheme for ATM Cell Scheduling Using Evolutionary Fuzzy System
Applied Intelligence
Bandwidth and latency analysis of modified deficit round robin scheduling algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
OCGRR: A New Scheduling Algorithm for Differentiated Services Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Analyzing Weighted Round Robin policies with a stochastic comparison approach
Computers and Operations Research
Fair link striping with FIFO delivery on heterogeneous channels
Computer Communications
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks
Computer Communications
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness
Computer Communications
Latency-differentiable start-time fair queuing
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
On achieving fairness in the joint allocation of processing and bandwidth resources
IWQoS'03 Proceedings of the 11th international conference on Quality of service
An efficient wireless switching architecture
WTS'10 Proceedings of the 9th conference on Wireless telecommunications symposium
Bonded deficit round robin scheduling for multi-channel networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
International Journal of Ad Hoc and Ubiquitous Computing
On the latency and fairness characteristics of pre-order deficit round Robin
Computer Communications
Review: A comprehensive survey on scheduler for VoIP over WLAN
Journal of Network and Computer Applications
An elastic compensation model for frame-based scheduling algorithms in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Parallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in the allocation of bandwidth available on a link among traffic flows of different users that share the link. Strict fairness in traffic scheduling can improve the isolation between users, offer a more predictable performance and improve performance by eliminating some bottlenecks. This paper presents a simple, fair, efficient, and easily implementable scheduling discipline, called Elastic Round Robin (ERR), designed to satisfy the unique needs of wormhole switching, which is popular in interconnection networks of parallel systems. In spite of the constraints of wormhole switching imposed on the design, ERR is also suitable for use in Internet routers and has better fairness and performance characteristics than previously known scheduling algorithms of comparable efficiency, including Deficit Round Robin and Surplus Round Robin. In this paper, we prove that ERR is efficient, with a per-packet work complexity of O(1). We analytically derive the relative fairness bound of ERR, a popular metric used to measure fairness. We also derive the bound on the start-up latency experienced by a new flow that arrives at an ERR scheduler. Finally, this paper presents simulation results comparing the fairness and performance characteristics of ERR with other scheduling disciplines of comparable efficiency.