Asymptotic behavior of a system of two coupled queues when the content of one queue is very high

Abstract

Abstract We consider a system of two parallel discrete-time single-server queues, queue 1 and queue 2. The service time of any customer in either queue is equal to 1 time slot. Arrivals during consecutive slots occur independently from slot to slot. However, the arrival streams into both queues are possibly mutually interdependent, i.e., during any slot, the numbers of arrivals in queue 1 and queue 2 need not be statistically independent. Their joint probability generating function (pgf) A ( x , y ) fully characterizes the queueing model. As a consequence of the possible intra-slot correlation in the arrival process, the numbers of customers present (“system contents”) in queues 1 and 2, at any given slot boundary, are not necessarily independent either. In a previous paper, we have already discussed the mathematical difficulty of computing their steady-state joint pgf $$U(z_1,z_2)$$ U ( z 1 , z 2 ) ; explicit closed-form results can only be obtained for specific choices of A ( x , y ). In this paper, we therefore look at the problem from an other angle. Specifically, we study the (asymptotic) conditional steady-state behavior of the system under the condition that the content of queue 1 is (temporarily) very high (goes to infinity). For ease of terminology, we refer to the system as the “asymptotic system” in these circumstances. We prove that the asymptotic system is nearly identical to the original (unconditional) system, but with a modified joint arrival pgf $$A^*(x,y)$$ A ∗ ( x , y ) that can be computed explicitly from A ( x , y ). This fundamental result allows us to determine the stability condition of queue 2 in the asymptotic system, and explicitly compute the classical queueing performance metrics of queue 2, such as the pgf, the moments and the approximate tail distribution of its system content, when this condition is fulfilled. It also leads to accurate approximative closed-form expressions for the joint tail distribution of the system contents in both queues, in the original (unconditional) system. We extensively illustrate our methodology by means of various specific (popular) choices of A ( x , y ). In some examples, where an explicit solution for $$U(z_1,z_2)$$ U ( z 1 , z 2 ) or for the (approximative) joint tail distribution is known, we retrieve the known results easily. In other cases, new results are found for arrival pgfs A ( x , y ) for which no explicit results were known until now.