The SCED Service Discipline with <I>O</I>(1) Complexity for Deadline Calculation

Kihyun PYUN; Heung-Kyu LEE

The SCED Service Discipline with O(1) Complexity for Deadline Calculation

Kihyun PYUN, Heung-Kyu LEE

Full Text Views

0

Cite this

Summary :

In order for a service discipline to be used for guaranteed service networks at very high speed, its overall implementation must be scalable while it provides as wide a network schedulability region as possible. From this point of view, GPS-based service disciplines provide a narrow network schedulability region while EDF-based disciplines suffer from the implementation complexities of rate-controllers and admission control. Alternatively, although service disciplines based on service-curves can provide a wider network schedulability region than GPS-based and EDF-based disciplines, they may have even worse implementation complexities than EDF-based disciplines. In this paper, we propose to employ a service discipline based on our specific service-curves. We show that our service discipline has comparable implementation complexity to GPS-based disciplines while providing the same wide network schedulability region that EDF-based disciplines can provide. In fact, this service discipline is an SCED service discipline proposed in [14]. However, our specific service-curves provide the SCED service discipline with the same network schedulability region that EDF-based disciplines can provide, O(1) complexity for deadline calculation, and O(N) complexity for admission control where N is the number of sessions.

Publication: IEICE TRANSACTIONS on Communications Vol.E85-B No.5 pp.1012-1019

Publication Date: 2002/05/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Kihyun PYUN, Heung-Kyu LEE, "The SCED Service Discipline with O(1) Complexity for Deadline Calculation" in IEICE TRANSACTIONS on Communications, vol. E85-B, no. 5, pp. 1012-1019, May 2002, doi: .
Abstract: In order for a service discipline to be used for guaranteed service networks at very high speed, its overall implementation must be scalable while it provides as wide a network schedulability region as possible. From this point of view, GPS-based service disciplines provide a narrow network schedulability region while EDF-based disciplines suffer from the implementation complexities of rate-controllers and admission control. Alternatively, although service disciplines based on service-curves can provide a wider network schedulability region than GPS-based and EDF-based disciplines, they may have even worse implementation complexities than EDF-based disciplines. In this paper, we propose to employ a service discipline based on our specific service-curves. We show that our service discipline has comparable implementation complexity to GPS-based disciplines while providing the same wide network schedulability region that EDF-based disciplines can provide. In fact, this service discipline is an SCED service discipline proposed in [14]. However, our specific service-curves provide the SCED service discipline with the same network schedulability region that EDF-based disciplines can provide, O(1) complexity for deadline calculation, and O(N) complexity for admission control where N is the number of sessions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_5_1012/_p

Copy

@ARTICLE{e85-b_5_1012,
author={Kihyun PYUN, Heung-Kyu LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={The SCED Service Discipline with O(1) Complexity for Deadline Calculation},
year={2002},
volume={E85-B},
number={5},
pages={1012-1019},
abstract={In order for a service discipline to be used for guaranteed service networks at very high speed, its overall implementation must be scalable while it provides as wide a network schedulability region as possible. From this point of view, GPS-based service disciplines provide a narrow network schedulability region while EDF-based disciplines suffer from the implementation complexities of rate-controllers and admission control. Alternatively, although service disciplines based on service-curves can provide a wider network schedulability region than GPS-based and EDF-based disciplines, they may have even worse implementation complexities than EDF-based disciplines. In this paper, we propose to employ a service discipline based on our specific service-curves. We show that our service discipline has comparable implementation complexity to GPS-based disciplines while providing the same wide network schedulability region that EDF-based disciplines can provide. In fact, this service discipline is an SCED service discipline proposed in [14]. However, our specific service-curves provide the SCED service discipline with the same network schedulability region that EDF-based disciplines can provide, O(1) complexity for deadline calculation, and O(N) complexity for admission control where N is the number of sessions.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - The SCED Service Discipline with O(1) Complexity for Deadline Calculation
T2 - IEICE TRANSACTIONS on Communications
SP - 1012
EP - 1019
AU - Kihyun PYUN
AU - Heung-Kyu LEE
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2002
AB - In order for a service discipline to be used for guaranteed service networks at very high speed, its overall implementation must be scalable while it provides as wide a network schedulability region as possible. From this point of view, GPS-based service disciplines provide a narrow network schedulability region while EDF-based disciplines suffer from the implementation complexities of rate-controllers and admission control. Alternatively, although service disciplines based on service-curves can provide a wider network schedulability region than GPS-based and EDF-based disciplines, they may have even worse implementation complexities than EDF-based disciplines. In this paper, we propose to employ a service discipline based on our specific service-curves. We show that our service discipline has comparable implementation complexity to GPS-based disciplines while providing the same wide network schedulability region that EDF-based disciplines can provide. In fact, this service discipline is an SCED service discipline proposed in [14]. However, our specific service-curves provide the SCED service discipline with the same network schedulability region that EDF-based disciplines can provide, O(1) complexity for deadline calculation, and O(N) complexity for admission control where N is the number of sessions.
ER -