Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
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)
Fair scheduling with tunable latency: a round-robin approach
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Decoupling the Bandwidth and Latency Bounding for Table-based Schedulers
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
A low-cost strategy to provide full QoS support in Advanced Switching networks
Journal of Systems Architecture: the EUROMICRO Journal
Improving the flexibility of the deficit table scheduler
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
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 |
Advanced Switching (AS) is a new fabric-interconnect technology, which provides the advanced features of existing proprietary fabrics in an open standard. AS is intended to proliferate in multiprocessor, storage, networking, servers, and embedded platform environments. 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. AS provides some mechanisms, which correctly used permit us to provide QoS. In this paper we examine these mechanisms and show how to provide QoS based on bandwidth and latency requirements. Furthermore, we propose a new algorithm based on the Self-Clocked Weighted Fair Queuing (SCFQ) algorithm, which we call SCFQ Credit Aware (SCFQ-CA), as an implementation of the AS minimum bandwidth egress link scheduler. Finally, we show that the AS table-based scheduler does not work properly with variable packet sizes, and we propose a modification of the table scheduler, based on the Deficit Table (DTable) scheduler, to solve this drawback.