IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
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 scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
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
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
IEEE Communications Magazine
QoS Aware Job Scheduling in a Cluster-Based Web Server for Multimedia Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Providing Quality of Service over Advanced Switching
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
OCGRR: A New Scheduling Algorithm for Differentiated Services Networks
IEEE Transactions on Parallel and Distributed Systems
Computers and Industrial Engineering
Differential virtual time (DVT): rethinking I/O service differentiation for virtual machines
Proceedings of the 1st ACM symposium on Cloud computing
Fully hardware based WFQ architecture for high-speed QoS packet scheduling
Integration, the VLSI Journal
Improving the flexibility of the deficit table scheduler
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Scheduling scheme with fairness and adaptation in the joint allocation of heterogeneous resources
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Hardware implementation study of several new egress link scheduling algorithms
Journal of Parallel and Distributed Computing
A fair spectrum sharing approach in Cognitive Radio Networks
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Fuzzy adaptive control for heterogeneous tasks in high-performance storage systems
Proceedings of the 6th International Systems and Storage Conference
Non-monetary fair scheduling: a cooperative game theory approach
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
Weighted fair queueing (WFQ)-based packet scheduling schemes require processing at line speeds for tag computation and tag sorting. This requirement presents a bottleneck for their implementation at high transmission speeds. In this paper, we propose an alternative and lower complexity approach to packet scheduling, based on modifications of the classical round-robin scheduler. Contrary to conventional belief, we show that appropriate modifications of the weighted round-robin (WRR) service discipline can, in fact, provide tight fairness properties and efficient delay guarantees to multiple sessions. Two such modifications are described: 1) list-based round robin, in which the server visits different sessions according to a precomputed list which is designed to obtain the desirable scheduling properties and 2) multiclass round robin, a version of hierarchical round robin with controls designed for good scheduling properties. The schemes considered are compared with well-known WFQ schemes and with deficit round robin (a credit-based WRR), on the basis of desirable properties such as bandwidth guarantees, fairness in excess bandwidth sharing, worst-case fairness, and efficiency of latency (delay guarantee) tuning. The scheduling schemes proposed and analyzed here operate with fixed packet sizes, and hence can be used in applications such as cell scheduling in ATM networks, time-slot scheduling on wireless links as in GPRS air interface, etc. A credit-based extension of the proposed schemes to handle variable packet sizes is also possible.