Buffer management for lossless service in shared buffer switches
Journal of Parallel and Distributed Computing
Fair queueing based packet scheduling for buffered crossbar switches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Arbitration of many thousand flows at 100G and beyond
Proceedings of the 2013 Interconnection Network Architecture: On-Chip, Multi-Chip
QoS-aware downlink packet scheduling for LTE networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Intelligent Randomize Round Robin for Cloud Computing
International Journal of Cloud Applications and Computing
QFQ: efficient packet scheduling with tight guarantees
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 14.98 |
Round robin based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low complexity round robin scheduler, called Fair Round Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the stratified round robin scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round robin based low complexity packet schedulers. FRR offers better short-term fairness than stratified round robin and other existing round robin schedulers.