A new implementable scheduling algorithm supporting various traffics in ATM networks-AWRR/DT

In this paper we propose a new scheduling algorithm called the adaptive weighted round robin with delay tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one-class queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every reset cycle. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-time classes. The proposed algorithm can be effectively applied to any high-speed network such as ATM networks.