Statistical admission control for real-time services under earliest deadline first scheduling

Zhi Quan, Jong-Moon Chung

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The design of call admission control (CAC) mechanisms has been a critical issue in providing quality-of-service (QoS) guarantees for heterogeneous traffic flows over integrated service (IntServ) and/or differentiated service (DiffServ) networks. Earliest deadline first (EDF) is an ideal scheduler for real-time services because of its optimal admissible region and delay bound properties. The major difficulty in developing an effective and efficient CAC algorithm for statistical services is the analysis of per-class deadline violation (loss) probabilities with respect to the delay bounds. In this paper, we provide an analytical approach to evaluate the aggregate and per-class deadline violation probabilities of an EDF scheduler. Based on these theoretical foundations, we derive the admission control conditions and then propose a CAC algorithm for statistic services under EDF scheduling. In addition, we show that the QoS metrics that an EDF scheduler actually guarantees have an asymptotic ordering property, which provides an important insight into the design and control of EDF networks. The effectiveness and performance of our proposed algorithm have been validated by trace-driven simulation experiments using MPEG and H.263 encoded video sources.

Original languageEnglish
Pages (from-to)137-154
Number of pages18
JournalComputer Networks
Volume48
Issue number2
DOIs
Publication statusPublished - 2005 Jun 6

Fingerprint

Congestion control (communication)
Access control
Scheduling
Quality of service
Telecommunication traffic
Statistics
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{cbb99c7b9ae5461dbb2c3df0dd8a26e2,
title = "Statistical admission control for real-time services under earliest deadline first scheduling",
abstract = "The design of call admission control (CAC) mechanisms has been a critical issue in providing quality-of-service (QoS) guarantees for heterogeneous traffic flows over integrated service (IntServ) and/or differentiated service (DiffServ) networks. Earliest deadline first (EDF) is an ideal scheduler for real-time services because of its optimal admissible region and delay bound properties. The major difficulty in developing an effective and efficient CAC algorithm for statistical services is the analysis of per-class deadline violation (loss) probabilities with respect to the delay bounds. In this paper, we provide an analytical approach to evaluate the aggregate and per-class deadline violation probabilities of an EDF scheduler. Based on these theoretical foundations, we derive the admission control conditions and then propose a CAC algorithm for statistic services under EDF scheduling. In addition, we show that the QoS metrics that an EDF scheduler actually guarantees have an asymptotic ordering property, which provides an important insight into the design and control of EDF networks. The effectiveness and performance of our proposed algorithm have been validated by trace-driven simulation experiments using MPEG and H.263 encoded video sources.",
author = "Zhi Quan and Jong-Moon Chung",
year = "2005",
month = "6",
day = "6",
doi = "10.1016/j.comnet.2004.10.017",
language = "English",
volume = "48",
pages = "137--154",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "2",

}

Statistical admission control for real-time services under earliest deadline first scheduling. / Quan, Zhi; Chung, Jong-Moon.

In: Computer Networks, Vol. 48, No. 2, 06.06.2005, p. 137-154.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Statistical admission control for real-time services under earliest deadline first scheduling

AU - Quan, Zhi

AU - Chung, Jong-Moon

PY - 2005/6/6

Y1 - 2005/6/6

N2 - The design of call admission control (CAC) mechanisms has been a critical issue in providing quality-of-service (QoS) guarantees for heterogeneous traffic flows over integrated service (IntServ) and/or differentiated service (DiffServ) networks. Earliest deadline first (EDF) is an ideal scheduler for real-time services because of its optimal admissible region and delay bound properties. The major difficulty in developing an effective and efficient CAC algorithm for statistical services is the analysis of per-class deadline violation (loss) probabilities with respect to the delay bounds. In this paper, we provide an analytical approach to evaluate the aggregate and per-class deadline violation probabilities of an EDF scheduler. Based on these theoretical foundations, we derive the admission control conditions and then propose a CAC algorithm for statistic services under EDF scheduling. In addition, we show that the QoS metrics that an EDF scheduler actually guarantees have an asymptotic ordering property, which provides an important insight into the design and control of EDF networks. The effectiveness and performance of our proposed algorithm have been validated by trace-driven simulation experiments using MPEG and H.263 encoded video sources.

AB - The design of call admission control (CAC) mechanisms has been a critical issue in providing quality-of-service (QoS) guarantees for heterogeneous traffic flows over integrated service (IntServ) and/or differentiated service (DiffServ) networks. Earliest deadline first (EDF) is an ideal scheduler for real-time services because of its optimal admissible region and delay bound properties. The major difficulty in developing an effective and efficient CAC algorithm for statistical services is the analysis of per-class deadline violation (loss) probabilities with respect to the delay bounds. In this paper, we provide an analytical approach to evaluate the aggregate and per-class deadline violation probabilities of an EDF scheduler. Based on these theoretical foundations, we derive the admission control conditions and then propose a CAC algorithm for statistic services under EDF scheduling. In addition, we show that the QoS metrics that an EDF scheduler actually guarantees have an asymptotic ordering property, which provides an important insight into the design and control of EDF networks. The effectiveness and performance of our proposed algorithm have been validated by trace-driven simulation experiments using MPEG and H.263 encoded video sources.

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

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

U2 - 10.1016/j.comnet.2004.10.017

DO - 10.1016/j.comnet.2004.10.017

M3 - Article

VL - 48

SP - 137

EP - 154

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 2

ER -