QoS技术基础-chpt2.pptVIP

Elements of Queuing Theory The queuing model Core components; Notation; Parameters and performance measures Characteristics; Markov Process Discrete-time Markov chain; Continuous-time Markov chain; Birth-death process; Some typical and often-used distributions Exponential Distribution; Poisson Distribution; M/M/1 Little’s Law Brief review of M/M/s, M/G/1, M/D/1 Some additional discussions. Queuing Systems Core components of the model Arrival process Buffer (the so-called queue) Infinite or finite; Service process single or parallel servers Service discipline (FIFO, random) Kendall Notation for Queuing Systems (1951) a/b/s/e/p/d a, specifies the arrival process b, specifies the service process s, is the number of parallel servers in the system e, (usually ?) is buffer size (i.e. maximum number of customers allowed in system) p, (usually ?) is size of customer population d, is the service discipline (FIFO, LIFO, etc.) Queuing model parameters ? = average rate of customer arrivals (no. of customers/unit time) ? = average rate of customer serviced by a server (no. of customers/unit time) (1/ ? = average service time) s = number of servers (channels) in the system If ? s ?, then . . . If ? s ?, then . . . The queuing systems is in steady state when the rate of departures from the system equals the rate of arrivals. Queuing Performance Measures Lq = average number of customers in queue Wq = average waiting time in queue (until service starts) L = average number of customers in system = Lq + (average number being served) W = average time a customer spends in system = Wq + 1/ ? ? = utilization factor = ?/(s ?) = fraction of time a server is busy (on average) Pn = the probability that exactly n customers are in the system Pzn = the probability that at least n customers are in the system PW = Pzs = the probability that a customer must wait for service (or the fraction of customers who must wait at least some time in the queue) Markov