A simple scheduling algorithm guaranteeing delay bounds in ATM networks

Jae Jeong Shim, J. Y. Pyun, S. J. Ko

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1525-1528
Number of pages4
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number6
Publication statusPublished - 2001 Jun


  • ATM
  • Per-class queueing
  • QoS
  • Scheduling

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'A simple scheduling algorithm guaranteeing delay bounds in ATM networks'. Together they form a unique fingerprint.

Cite this