Fast admission control for rate monotonie schedulers

Tsern-Huei Lee*, An Bang Chang

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

Rate monotonie traffic scheduling algorithm had been shown [1] to be the optimal static priority assignment scheme. The system model studied in [1] 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 monotonie schedulers for a fixedlength 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 monotonie 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.

Original languageEnglish
Pages (from-to)39-46
Number of pages8
JournalIEICE Transactions on Communications
VolumeE82-B
Issue number1
StatePublished - 1 Jan 1999

Keywords

  • Admission control
  • Delay jitter
  • Real-time applications
  • Scheduling

Fingerprint Dive into the research topics of 'Fast admission control for rate monotonie schedulers'. Together they form a unique fingerprint.

Cite this