ABSTRACT
This chapter describes in somewhat more detail the types of arrival pattern, service mechanism and queue-discipline that are most used in the mathematical theory. The simplest arrival pattern mathematically, and the most commonly useful one in applications, is when the arrivals are completely random. From a mathematical point of view these schemes are closely related to aggregated arrivals in which the arrival instants are equally spaced and the number of arrivals per instant is 0 or 1. Sometimes the rate of arrival of customers is correlated with other properties of the system, usually with the number of customers awaiting service. Occasionally, however, the customers are to be treated as a continuous flow. The arrival pattern for the second queue is then the independent form with the distribution function equal to the distribution function of service-time in the first queue.
