Multiple delay bounds control algorithm via class-level service curves

Daein Jeong, H. Jonathan Chao, Hwasung Kim

Research output: Contribution to journalArticle

Abstract

In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.

Original languageEnglish (US)
Pages (from-to)2868-2879
Number of pages12
JournalIEICE Transactions on Communications
VolumeE85-B
Issue number12
StatePublished - Dec 2002

Fingerprint

Packet networks
Scheduling algorithms
Telecommunication traffic
Scalability
Computational complexity
Quality of service

Keywords

  • Delay control
  • Fair queueing
  • Firewall
  • Packet scheduling
  • Priority control

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Multiple delay bounds control algorithm via class-level service curves. / Jeong, Daein; Chao, H. Jonathan; Kim, Hwasung.

In: IEICE Transactions on Communications, Vol. E85-B, No. 12, 12.2002, p. 2868-2879.

Research output: Contribution to journalArticle

@article{fd9e69748bc947038c2cdfe65d1a68fb,
title = "Multiple delay bounds control algorithm via class-level service curves",
abstract = "In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.",
keywords = "Delay control, Fair queueing, Firewall, Packet scheduling, Priority control",
author = "Daein Jeong and Chao, {H. Jonathan} and Hwasung Kim",
year = "2002",
month = "12",
language = "English (US)",
volume = "E85-B",
pages = "2868--2879",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Multiple delay bounds control algorithm via class-level service curves

AU - Jeong, Daein

AU - Chao, H. Jonathan

AU - Kim, Hwasung

PY - 2002/12

Y1 - 2002/12

N2 - In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.

AB - In this paper, we propose a packet-scheduling algorithm, called the Class-level Service Lagging (CSL) algorithm, that guarantees multiple delay bounds for multi-class traffic in packet networks. We derive the associated schedulability test conditions, which are used to determine call admission. We first introduce a novel implementation of priority control, which has a conventional and simple form. We show how the efforts to confirm the logical validity of that implementation are managed to reach the definition of the CSL algorithm. The priority control is realized by imposing class-level unfairness in service provisioning, while the underlying service mechanism is carried out using the notion of fair queueing. The adoption of fair queueing allows the capability to maintain the service quality of the well-behaving traffic even in the presence of misbehaving traffic. We call this the firewall property. Simulation results demonstrate the superiority of the CSL algorithm in both priority control and firewall functionality. We also describe how the CSL algorithm is implementable with a computational complexity of O(1). Those features as well as the enhanced scalability, which results from the class-level approach, confirm the adequacy of the CSL algorithm for the fast packet networks.

KW - Delay control

KW - Fair queueing

KW - Firewall

KW - Packet scheduling

KW - Priority control

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

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

M3 - Article

VL - E85-B

SP - 2868

EP - 2879

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 12

ER -