Efficient scheduling discipline for Hierarchical Diff-EDF

Moutaz Saleh, Zulaiha Ali Othman

Research output: Contribution to journalArticle

Abstract

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.

Original languageEnglish
Pages (from-to)279-294
Number of pages16
JournalInternational Journal of Network Management
Volume18
Issue number3
DOIs
Publication statusPublished - May 2008

Fingerprint

Scheduling algorithms
Quality of service
Packet networks
Scheduling
Telecommunication traffic
Feedback control

ASJC Scopus subject areas

  • Software

Cite this

Efficient scheduling discipline for Hierarchical Diff-EDF. / Saleh, Moutaz; Ali Othman, Zulaiha.

In: International Journal of Network Management, Vol. 18, No. 3, 05.2008, p. 279-294.

Research output: Contribution to journalArticle

@article{bcd9042d88a14ec1b259dba07690faea,
title = "Efficient scheduling discipline for Hierarchical Diff-EDF",
abstract = "Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.",
author = "Moutaz Saleh and {Ali Othman}, Zulaiha",
year = "2008",
month = "5",
doi = "10.1002/nem.661",
language = "English",
volume = "18",
pages = "279--294",
journal = "International Journal of Network Management",
issn = "1055-7148",
publisher = "John Wiley and Sons Ltd",
number = "3",

}

TY - JOUR

T1 - Efficient scheduling discipline for Hierarchical Diff-EDF

AU - Saleh, Moutaz

AU - Ali Othman, Zulaiha

PY - 2008/5

Y1 - 2008/5

N2 - Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.

AB - Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.

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

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

U2 - 10.1002/nem.661

DO - 10.1002/nem.661

M3 - Article

AN - SCOPUS:47749117215

VL - 18

SP - 279

EP - 294

JO - International Journal of Network Management

JF - International Journal of Network Management

SN - 1055-7148

IS - 3

ER -