Providing QoS with the Deficit Table Scheduler
- 2 May 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 21 (3), 327-341
- https://doi.org/10.1109/tpds.2009.75
Abstract
A key component for networks with Quality of Service (QoS) support is the egress link scheduling algorithm. An ideal scheduling algorithm implemented in a high-performance network with QoS support should satisfy two main properties: good end-to-end delay and implementation simplicity. Table-based schedulers try to offer a simple implementation and good latency bounds. Some of the latest proposals of network technologies, like Advanced Switching and InfiniBand, include in their specifications one of these schedulers. However, these table-based schedulers do not work properly with variable packet sizes, as is usually the case in current network technologies. We have proposed a new table-based scheduler, which we have called Deficit Table (DTable) scheduler, that works properly with variable packet sizes. Moreover, we have proposed a methodology to configure this table-based scheduler in such a way that it permits us to decouple the bounding between the bandwidth and latency assignments. In this paper, we thoroughly review the provision of QoS with the DTable scheduler and our configuration methodology, and evaluate the performance of our proposals in a multimedia scenario. Simulation results show that our proposals are able to provide a similar latency performance than more complex scheduling algorithms. Moreover, we show the advantages of our decoupling configuration methodology over the usual ways of configuring this kind of table-based schedulers.Keywords
This publication has 28 references indexed in Scilit:
- Implementing the Advanced Switching Minimum Bandwidth Egress Link SchedulerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Interconnect-Aware Coherence Protocols for Chip MultiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Improving the Flexibility of the Deficit Table SchedulerLecture Notes in Computer Science, 2006
- QoS in InfiniBand subnetworksIEEE Transactions on Parallel and Distributed Systems, 2004
- Fair scheduling with tunable latency: A round-robin approachIEEE/ACM Transactions on Networking, 2003
- Stratified round RobinPublished by Association for Computing Machinery (ACM) ,2003
- WF/sup 2/Q: worst-case fair weighted fair queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networksPublished by Association for Computing Machinery (ACM) ,2001
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- “Hot spot” contention and combining in multistage interconnection networksIEEE Transactions on Computers, 1985