4.17 Probability that a server is busy We
have shown in th text
that for a M/M/1 and a M/G/1 queueing system with infinite
queueing capacity, the
probability that the server is busy is equal to the utilization
(=/) in steady state.
Show that in the case
of a M/M/m system with
infinite queueing capacity, the steady-state probability of any
server being busy is still
equal to p (= /m).