We assume the classic M/M/c queueing model with Poisson arrival process,
exponential service time and no queueing capacity.
That is, any new customer that sees all servers busy at their time of arrival
will be blocked from the system and forced to abandon.
The number of states in the system is equal to: number of servers + 1 (empty state).
With a minimum of 1 server, this queueing system is always stable, because there is no waiting queue.
All non-blocked customers are automatically served and their waiting time is 0.