A Simple Scheduling Algorithm Guaranteeing Delay Bounds in ATM Networks

Jae-Jeong SHIM  Jae-Young PYUN  Sung-Jea KO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E84-A    No.6    pp.1525-1528
Publication Date: 2001/06/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Papers Selected from 2000 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2000))
ATM,  scheduling,  per-class queueing,  QoS,  

Full Text: PDF>>
Buy this Article

A new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT) is presented. This scheme can adapt to the traffic fluctuation of networks with a small processing burden. The proposed scheme incorporates a cell discarding method to reduce the QoS degradation in high-loaded (or congested) period. Simulation results show that the proposed scheme can reduce the average delay of the non-real-time (NRT) class, especially in high-loaded conditions, while maintaining the QoS of real-time (RT) classes. Our scheme with the discarding method can also reduce both the mean waiting time and cell loss ratio of RT classes.