A Statistical Framework for EDF Scheduling

Zhi Ouan, Jong-Moon Chung

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.

Original languageEnglish
Pages (from-to)493-495
Number of pages3
JournalIEEE Communications Letters
Volume7
Issue number10
DOIs
Publication statusPublished - 2003 Oct 1

Fingerprint

Earliest Deadline First
Loss Probability
Scheduling
Deadline
Service Differentiation
High-speed Networks
HIgh speed networks
Asymptotic Approximation
Network Traffic
Quality of Service
Switch
Quality of service
Switches
Traffic
Metric
Predict
Framework
Simulation

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{d2352e2cf74143d0b949c9f9b49a1033,
title = "A Statistical Framework for EDF Scheduling",
abstract = "Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.",
author = "Zhi Ouan and Jong-Moon Chung",
year = "2003",
month = "10",
day = "1",
doi = "10.1109/LCOMM.2003.817320",
language = "English",
volume = "7",
pages = "493--495",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

A Statistical Framework for EDF Scheduling. / Ouan, Zhi; Chung, Jong-Moon.

In: IEEE Communications Letters, Vol. 7, No. 10, 01.10.2003, p. 493-495.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Statistical Framework for EDF Scheduling

AU - Ouan, Zhi

AU - Chung, Jong-Moon

PY - 2003/10/1

Y1 - 2003/10/1

N2 - Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.

AB - Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.

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

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

U2 - 10.1109/LCOMM.2003.817320

DO - 10.1109/LCOMM.2003.817320

M3 - Article

VL - 7

SP - 493

EP - 495

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

ER -