IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
The Stratified Round Robin scheduler: design, analysis and implementation
IEEE/ACM Transactions on Networking (TON)
Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness
IEEE Transactions on Computers
On-chip communication and synchronization mechanisms with cache-integrated network interfaces
Proceedings of the 7th ACM international conference on Computing frontiers
Proceedings of the ACM SIGCOMM 2010 conference
Short and Fat: TCP Performance in CEE Datacenter Networks
HOTI '11 Proceedings of the 2011 IEEE 19th Annual Symposium on High Performance Interconnects
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Network devices supporting above-100G links are needed today in order to scale communication bandwidth along with the processing capabilities of computing nodes in data centers and warehouse computers. In this paper, we propose a light-weight, fair scheduler for such ultra high-speed links, and an arbitrarily large number of requestors. We show that, in practice, our first algorithm, as well its predecessor, DRR, may result in bursty service even in the common case, where flow weights are approximately equal, and we identify applications where this can damage performance. Our second contribution is an enhancement that improves short-term fairness to deliver very smooth service when flow weights are approximately equal, whilst allocating bandwidth in a weighted fair manner.