Browsing by Author "Chang, AB"

Now showing 1 - 2 of 2

Admission control for ATM networks using rate monotonic traffic scheduling algorithm
(1997)
Lee, TH
;
Chang, AB
;
交大名義發表
;
傳播研究所
;
National Chiao Tung University
Rate monotonic scheduling algorithm had been shown [1] to be the optimum static priority assignment scheme for an environment where packets are of variable length and a higher priority packet can preempt a lower priority one without causing any loss. It is optimum in the sense that if a set of m constant bit rate connections are schedulable (i.e., every packet is served before its succeeding packet arrives) with any static priority assignment scheme, then they are schedulable with rate monotonic scheduling algorithm. In this paper, we study the schedulability issue of rate monotonic scheduling algorithm for ATM networks where all packets are of the same length. We prove a necessary and sufficient condition for a set of m constant bit rate connections to be rate monotonic schedulable. Based on the necessary and sufficient condition, we design a simple admission control algorithm. We also present a sufficient condition which can be used for fast admission control if there are only a few possible periods for the connections.
Fast admission control for rate monotonic schedulers
(1999-01-01)
Lee, TH
;
Chang, AB
;
交大名義發表
;
傳播研究所
;
National Chiao Tung University
Rate monotonic 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 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.