An adaptive scheduler to provide QoS guarantees in an input-buffered switch

This paper proposes an adaptive scheduler for an input-buffered switch to provide the quality of service (QoS) guarantees for various traffic classes. The algorithm introduced in the scheduler is based on the bandwidth reservation of each connection. The novelty of our scheduler is that it uniformly deals with various traffic classes without strict priority, and it is flexible to effectively use the remaining resources of the switch for any traffic pattern without starvation. By comparing with some well-known schedulers, the effectiveness of our scheduler in terms of throughput, packet delay and delay deviation, is clarified by computer simulation.