Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
VoIP Performance on Differentiated Services Enabled Network
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Fair scheduling with tunable latency: a round-robin approach
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Providing Quality of Service over Advanced Switching
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Decoupling the Bandwidth and Latency Bounding for Table-based Schedulers
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Implementing the Advanced Switching Minimum Bandwidth Egress Link Scheduler
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
QoS in Packet Networks
Studying several proposals for the adaptation of the DTable scheduler to advanced switching
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
A key component for networks with Quality of Service (QoS) support is the egress link scheduler. The table-based schedulers are simple to implement and can offer good latency bounds. Some of the latest proposals of network technologies, like Advanced Switching and InfiniBand, define in their specifications one of these schedulers. However, these schedulers do not work properly with variable packet sizes and face the problem of bounding the bandwidth and latency assignments. We have proposed a new table-based scheduler, the Deficit Table (DTable) scheduler, that works properly with variable packet sizes. Moreover, we have proposed a methodology to configure this table-based scheduler that partially decouples the bandwidth and latency assignments. In this paper we propose a method to improve the flexibility of the decoupling methodology. Moreover, we compare the latency performance of this strategy with two well-known scheduling algorithms: the Self-Clocked Weighted Fair Queuing (SCFQ) and the Deficit Round Robin (DRR) algorithms.