Lecture Outline M/M/1: finite system capacity, K M/M/m: finite system capacity, K M/M/m: finite system capacity, K=m Related observations and extensions M/E,/1 example M/G/1: epochs and transition probabilities M/G/1: derivation of L Why M/G/m, G/G/1, etc. are difficult
Birth-and-Death Queuing Systems 1. m parallel, identical servers. 2. Infinite queue capacity. 3. Whenever users are in system (in queue plus in service) arrivals are Poisson at rate of an per unit of time. 4. Whenever n users are in system, service completions are Poisson at rate of un per unit of time. 5. FCFS discipline