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
O algoritmo de escalonamento de tráfego monotônico de taxa demonstrou ser o esquema ideal de atribuição de prioridade estática. O modelo de sistema estudado pode ser considerado (embora não realista) como um multiplexador preemptivo que aceita conexões com taxa de bits constante que geram pacotes periodicamente. O multiplexador adota uma disciplina de serviço tal que um pacote de prioridade mais baixa pode ser preemptado em qualquer estágio por um pacote de prioridade mais alta sem qualquer perda. A restrição é que cada pacote deve completar seu serviço antes da chegada do pacote seguinte gerado pela mesma conexão. Neste artigo, estudamos o problema de escalonabilidade de escalonadores monotônicos de taxa para uma rede comutada por pacotes de comprimento fixo, como a rede ATM. Uma condição necessária e suficiente para um conjunto de m conexões de taxa de bits constante para serem escalonáveis de taxa monotônica são primeiro derivadas e então utilizadas para projetar algoritmos de controle de admissão rápidos. Um dos nossos algoritmos calcula antecipadamente o período mínimo de uma ligação que pode ser aceite dado um conjunto de ligações existentes.
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
Tsern-Huei LEE, An-Bang CHANG, "Fast Admission Control for Rate Monotonic Schedulers" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 1, pp. 39-47, January 1999, doi: .
Abstract: Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_1_39/_p
Copiar
@ARTICLE{e82-b_1_39,
author={Tsern-Huei LEE, An-Bang CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Admission Control for Rate Monotonic Schedulers},
year={1999},
volume={E82-B},
number={1},
pages={39-47},
abstract={Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.},
keywords={},
doi={},
ISSN={},
month={January},}
Copiar
TY - JOUR
TI - Fast Admission Control for Rate Monotonic Schedulers
T2 - IEICE TRANSACTIONS on Communications
SP - 39
EP - 47
AU - Tsern-Huei LEE
AU - An-Bang CHANG
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1999
AB - Rate monotonic traffic scheduling algorithm had been shown to be the optimal static priority assignment scheme. The system model studied in can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at any stage by a higher priority one without any loss. The constraint is that every packet has to complete its service before the arrival of its succeeding packet generated by the same connection. In this paper, we study the schedulability problem of rate monotonic schedulers for a fixed-length packet switched network such as the ATM network. A necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable is first derived and then utilized to design fast admission control algorithms. One of our algorithms computes in advance the minimum period of a connection which can be accepted given a set of existing connections.
ER -