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 rho.gif (189 bytes)(=lambda.gif (179 bytes)/mu.gif (189 bytes)) 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 (= lambda.gif (179 bytes)/mmu.gif (189 bytes)).