Admission control for probabilistic services with earliest deadline first scheduling

Zhi Quan, Jong Moon Chung

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publication13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)
Pages211-216
Number of pages6
Publication statusPublished - 2004 Dec 1
Event13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004) - Mill Valley, CA, United States
Duration: 2004 Apr 252004 Apr 28

Publication series

Name13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)

Other

Other13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2004)
CountryUnited States
CityMill Valley, CA
Period04/4/2504/4/28

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Quan, Z., & Chung, J. M. (2004). Admission control for probabilistic services with earliest deadline first scheduling. In 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)).