A simple scheduling algorithm guaranteeing delay bounds in ATM networks

J. J. Shim, J. Y. Pyun, Sung-Jea Ko

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
VolumeE84-A
Issue number6
Publication statusPublished - 2001 Jun 1

Fingerprint

ATM Networks
Asynchronous transfer mode
Scheduling algorithms
Scheduling Algorithm
Quality of service
Real-time
Degradation
Cell
Processing
Waiting Time
Tolerance
Traffic
Fluctuations
Class
Simulation

Keywords

  • ATM
  • Per-class queueing
  • QoS
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

A simple scheduling algorithm guaranteeing delay bounds in ATM networks. / Shim, J. J.; Pyun, J. Y.; Ko, Sung-Jea.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E84-A, No. 6, 01.06.2001, p. 1525-1528.

Research output: Contribution to journalArticle

@article{1aed4eab3df94619a2236133f5d6b99f,
title = "A simple scheduling algorithm guaranteeing delay bounds in ATM networks",
abstract = "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.",
keywords = "ATM, Per-class queueing, QoS, Scheduling",
author = "Shim, {J. J.} and Pyun, {J. Y.} and Sung-Jea Ko",
year = "2001",
month = "6",
day = "1",
language = "English",
volume = "E84-A",
pages = "1525--1528",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

TY - JOUR

T1 - A simple scheduling algorithm guaranteeing delay bounds in ATM networks

AU - Shim, J. J.

AU - Pyun, J. Y.

AU - Ko, Sung-Jea

PY - 2001/6/1

Y1 - 2001/6/1

N2 - 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.

AB - 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.

KW - ATM

KW - Per-class queueing

KW - QoS

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0035367587&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035367587&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035367587

VL - E84-A

SP - 1525

EP - 1528

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 6

ER -