Paper 3, Section II, K
We consider a system of two queues in tandem, as follows. Customers arrive in the first queue at rate . Each arriving customer is immediately served by one of infinitely many servers at rate . Immediately after service, customers join a single-server second queue which operates on a first-come, first-served basis, and has a service rate . After service in this second queue, each customer returns to the first queue with probability , and otherwise leaves the system forever. A schematic representation is given below:
(a) Let and denote the number of customers at time in queues number 1 and 2 respectively, including those currently in service at time . Give the transition rates of the Markov chain .
(b) Write down an equation satisfied by any invariant measure for this Markov chain. Let and . Define a measure by
Show that it is possible to find so that is an invariant measure of , if and only if . Give the values of and in this case.
(c) Assume now that . Show that the number of customers is not positive recurrent.
[Hint. One way to solve the problem is as follows. Assume it is positive recurrent. Observe that is greater than a queue with arrival rate . Deduce that is greater than a queue with arrival rate and service rate . You may use without proof the fact that the departure process from the first queue is then, at equilibrium, a Poisson process with rate , and you may use without proof properties of thinned Poisson processes.]