Consider Poisson traffic offered to a group of n trunks. Blocked calls are cleared, and call holding times are independent and identically distributed. In equilibrium, the call congestion is given by the well-known Erlang B formula1
No takes yet. Share an insight, caveat, or question.
E. J. Messerli (1972) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: