Fast Admission Control for Rate Monotonic Schedulers

Tsern-Huei LEE; An-Bang CHANG

Fast Admission Control for Rate Monotonic Schedulers

Tsern-Huei LEE, An-Bang CHANG

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E82-B No.1 pp.39-47

Publication Date: 1999/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Switching and Communication Processing

Cite this

Copy

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

Copy

@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},}

Copy

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 -