Here is a variation of the single-server queue model. We make the same assumptions as for the M/M/1 model, but with the following twist. Customers are impatient. When a new customer arrives, he joins the queue with probability (1/(n+1))where n is the total number of customers present in the system at the time the new customer arrives. Specify the parameters for this Markov chain.

At the above question, obtain the stationary law of the chain. In the long run, what is the average number of customers in the system?

Answer rating: 100% (QA)

Obtain the stationary law of the chain We have a Markov ... View the full answer