ABSTRACT
The most fundamental queueing models, and perhaps the most researched as well, are those that can be modeled as continuous time Markov chains (CTMC). In this chapter, we are specifically interested in such queueingmodels for which we can obtain closed-form algebraic expressions for various performance measures. A common framework for all these models is that the potential customer arrivals occur according to a Poisson process with parameter λ, and the service time for each server is according to exp(μ). Note that the inter-arrival times for potential customers are according to exp(λ) distribution, but all arriving customers may not enter the system.
