Admission control for probabilistic services with earliest deadline first scheduling

Zhi Quan; Jong Moon Chung

Admission control for probabilistic services with earliest deadline first scheduling

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

An call admission control (CAC) algorithm for probabilistic services scheduled by an EDF scheduler was presented. The connections with similar quality of service (QoS) constraints as an aggregate traffic class were considered. The algorithm differs from others in that it is derived from the analysis of per-class QoS metrics. It was found that due to strict coupling between the deadline violation probability and the delay bound, the QoS metrics that an EDF scheduler actually gurantees have an asymptotic ordering property, which provides a serious implication for the design and control of EDF networks. The investigation on robust admission control mechanisms were being conducted to support long-range dependent processes with infinite variances.

Original language	English
Title of host publication	13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)
Pages	211-216
Number of pages	6
Publication status	Published - 2004
Event	13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004) - Mill Valley, CA, United States Duration: 2004 Apr 25 → 2004 Apr 28

Publication series

Name	13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)

Other

Other	13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)
Country/Territory	United States
City	Mill Valley, CA
Period	04/4/25 → 04/4/28

All Science Journal Classification (ASJC) codes

Engineering(all)

Cite this

@inproceedings{a9ff9ff515724c819b4ac6e62529a818,

title = "Admission control for probabilistic services with earliest deadline first scheduling",

abstract = "An call admission control (CAC) algorithm for probabilistic services scheduled by an EDF scheduler was presented. The connections with similar quality of service (QoS) constraints as an aggregate traffic class were considered. The algorithm differs from others in that it is derived from the analysis of per-class QoS metrics. It was found that due to strict coupling between the deadline violation probability and the delay bound, the QoS metrics that an EDF scheduler actually gurantees have an asymptotic ordering property, which provides a serious implication for the design and control of EDF networks. The investigation on robust admission control mechanisms were being conducted to support long-range dependent processes with infinite variances.",

author = "Zhi Quan and Chung, {Jong Moon}",

year = "2004",

language = "English",

isbn = "0780385519",

series = "13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)",

pages = "211--216",

booktitle = "13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)",

note = "13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004) ; Conference date: 25-04-2004 Through 28-04-2004",

}

Quan, Z & Chung, JM 2004, Admission control for probabilistic services with earliest deadline first scheduling. in 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004). 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004), pp. 211-216, 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004), Mill Valley, CA, United States, 04/4/25.

Admission control for probabilistic services with earliest deadline first scheduling. / Quan, Zhi; Chung, Jong Moon.
13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004). 2004. p. 211-216 (13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Admission control for probabilistic services with earliest deadline first scheduling

AU - Quan, Zhi

AU - Chung, Jong Moon

PY - 2004

Y1 - 2004

N2 - An call admission control (CAC) algorithm for probabilistic services scheduled by an EDF scheduler was presented. The connections with similar quality of service (QoS) constraints as an aggregate traffic class were considered. The algorithm differs from others in that it is derived from the analysis of per-class QoS metrics. It was found that due to strict coupling between the deadline violation probability and the delay bound, the QoS metrics that an EDF scheduler actually gurantees have an asymptotic ordering property, which provides a serious implication for the design and control of EDF networks. The investigation on robust admission control mechanisms were being conducted to support long-range dependent processes with infinite variances.

AB - An call admission control (CAC) algorithm for probabilistic services scheduled by an EDF scheduler was presented. The connections with similar quality of service (QoS) constraints as an aggregate traffic class were considered. The algorithm differs from others in that it is derived from the analysis of per-class QoS metrics. It was found that due to strict coupling between the deadline violation probability and the delay bound, the QoS metrics that an EDF scheduler actually gurantees have an asymptotic ordering property, which provides a serious implication for the design and control of EDF networks. The investigation on robust admission control mechanisms were being conducted to support long-range dependent processes with infinite variances.

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

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

M3 - Conference contribution

AN - SCOPUS:11244299736

SN - 0780385519

SN - 9780780385511

T3 - 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)

SP - 211

EP - 216

BT - 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)

T2 - 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)

Y2 - 25 April 2004 through 28 April 2004

ER -

Admission control for probabilistic services with earliest deadline first scheduling

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this