Skip to content
Part CCSIR NET December 2025with-2-servers-the-death-rate-caps-at-2-mu-once-both-servers-are-busy-it-does-not-keep-scaling-with-n

With 2 servers the death rate caps at 2 mu once both servers are busy it does not keep scaling with n

Consider an M/M/2 queuing system with the birth rate λ=4\lambda=4 per minute, the death rate μ=1\mu=1 per minute, and the total capacity of 3 customers (including the ones that are being served). Let p0p_{0} and p3p_{3} denote the long-run probabilities that the system will be empty (i.e. without customers) and will be blocked (i.e. full), respectively. Which of the following statements are true?

  1. A.p0+p3=17/29p_{0}+p_{3} = 17/29
  2. B.p0>p3p_{0} > p_{3}
  3. C.p3/p0=2p_{3}/p_{0} = 2
  4. D.p3p0=15/29p_{3}-p_{0} = 15/29

You have the answer. Trap Analysis is why the other three were written.

Not a worked solution repeated four times — the specific reasoning error each wrong option was built to reward.

See pricing

50 are analysed free — try those first.

Related counterexample: An irreducible chain with a stationary distribution converges to it

More on this topic

The chapter behind this: Markov chains: classification and stationary behaviour — free to read

From Limit Theorems and Markov ChainsMarkov chains: classification of states, stationary distributions

Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.

ShareWhatsAppTelegram