Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
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)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Fair Real-Time Traffic Scheduling over a Wireless LAN
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
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
Implementing scheduling algorithms in high-speed networks
IEEE Journal on Selected Areas in Communications
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
| Hi-index | 0.00 |
Fair scheduling algorithms are an important componentof most QoS mechanisms designed to support the performanceguarantees required by real-time applications. Inthis paper, we present Greedy Fair Queueing (GrFQ), anovel scheduler based on a greedy strategy of reducing themaximum difference in normalized service received by anytwo flows at each trasmission boundary. We prove thatthe GrFQ scheduler achieves a better bound on the normalizedlag than other known schedulers. We further proposea simplified version of the scheduler, called GrFQ-lite,which avoids the emulation of a fluid flow system and hasa per-packet work complexity of O(1) in the computationof the timestamps. Borrowing from the field of economics,we use the Gini index as a measure of instantaneous fairness.Using real gateway traffic traces, we show that theGrFQ scheduler achieves better fairness than any otherknown scheduler at virtually all instants of time. We furthershow that the GrFQ-lite scheduler achieves equivalentor better fairness than other known schedulers includingthose that are significantly more computationally intensivein their emulation of the ideally fair fluid flow system.