A simple scheduling algorithm guaranteeing delay bounds in ATM networks

Citation
Jj. Shim et al., A simple scheduling algorithm guaranteeing delay bounds in ATM networks, IEICE T FUN, E84A(6), 2001, pp. 1525-1528
Citations number
7
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
ISSN journal
09168508 → ACNP
Volume
E84A
Issue
6
Year of publication
2001
Pages
1525 - 1528
Database
ISI
SICI code
0916-8508(200106)E84A:6<1525:ASSAGD>2.0.ZU;2-2
Abstract
A new scheduling algorithm called the Adaptive Weighted Round Robin with De lay 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 hig h-loaded Cor congested) period. Simulation results show that the proposed s cheme can reduce the average delay of the non-real-time (NRT) class, especi ally in high-loaded conditions, while maintaining the QoS of real-time (RT) classes. Our scheme with the discarding method can also reduce both the me an waiting time and cell loss ratio of RT classes.