Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
VoIP Performance on Differentiated Services Enabled Network
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
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
Improving the flexibility of the deficit table scheduler
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
| Hi-index | 0.00 |
Advanced Switching (AS) is a new fabric-interconnect technology that further enhances the capabilities of PCI Express. On the other hand, the provision of Quality of Service (QoS) in computing and communication environments is currently the focus of much discussion and research in industry and academia. A key component for networks with QoS support is the egress link scheduling algorithm. AS defines a table-based scheduler that is simple to implement and can offer good latency bounds with a fixed packet size. However, it does not work properly with variable packet sizes and faces the problem of bounding the bandwidth and latency assignments. In this paper we propose several possible modifications to the original AS table scheduler in order to implement the Deficit Table (DTable) scheduler. This scheduler works properly with variable packet sizes and allows to partially decouple the bandwidth and latency assignments.