The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Para que uma disciplina de serviço possa ser utilizada para redes de serviços garantidos a velocidades muito elevadas, a sua implementação global deve ser escalável, ao mesmo tempo que proporciona uma região de escalonamento de rede tão ampla quanto possível. Deste ponto de vista, as disciplinas de serviço baseadas em GPS fornecem uma região estreita de escalonamento de rede, enquanto as disciplinas baseadas em EDF sofrem com as complexidades de implementação de controladores de taxa e controle de admissão. Alternativamente, embora as disciplinas de serviço baseadas em curvas de serviço possam fornecer uma região de escalonamento de rede mais ampla do que as disciplinas baseadas em GPS e EDF, elas podem ter complexidades de implementação ainda piores do que as disciplinas baseadas em EDF. Neste artigo, propomos empregar uma disciplina de serviço baseada em nossas curvas de serviço específicas. Mostramos que nossa disciplina de serviço tem complexidade de implementação comparável às disciplinas baseadas em GPS, ao mesmo tempo que fornece a mesma ampla região de escalonamento de rede que as disciplinas baseadas em EDF podem fornecer. Na verdade, esta disciplina de serviço é uma disciplina de serviço SCED proposta em [14]. No entanto, nossas curvas de serviço específicas fornecem à disciplina de serviço SCED a mesma região de escalonamento de rede que as disciplinas baseadas em EDF podem fornecer, O(1) complexidade para cálculo de prazos, e O(N) complexidade para controle de admissão onde N é o número de sessões.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
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
Copiar
@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},}
Copiar
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 -