- There are s servers, where s is a positive integer
- Arrivals follow a Poisson distribution and occur at an average rate of l per time period.
- Each server provides service at an average rate of u per time period, and actual service times follow an exponential distribution.
- Arrivals wait in a single FIFO queue and are serviced by the first available server.
- l < s u