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.