Multiple delay bounds control algorithm via class-level service curves

Daein Jeong, H. Jonathan Chao, Hwasung Kim

Research output: Contribution to journalArticlepeer-review

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

Keywords

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

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Multiple delay bounds control algorithm via class-level service curves'. Together they form a unique fingerprint.

Cite this