Semi-Markov Models of Queueing Systems

Abstract

Queueing systems can be classified according to the logical structure of the service process (number of servers, order priorities, possibility of waiting, etc.) as well as the analytical assumptions concerning the incoming stream of customers and the distribution of service time. The classification proposed by Kendall is the one commonly used. Many authors extended this classification [see, e.g., Borovkov’s book (1972)]. For our purposes Kendall’s classification is sufficient.