In this paper, we study the asymptotic behaviour of the tail probability of the number of customers in the steady-state retrial queue with Bernoulli schedule, under the assumption that the service time distribution has a regularly varying tail. Detailed tail asymptotic properties are obtained for the conditional probability of the number of customers in the (priority) queue and orbit, respectively, in terms of the recently proposed exhaustive stochastic decomposition approach. Numerical examples are presented to show the impacts of system parameters on the tail asymptotic probabilities.
In the literature, retrial queues with batch arrivals and heavy service times have been studied and the so-called equivalence theorem has been established under the condition that the service time is heavier than the batch size. The equivalence theorem provides the distribution (or tail) equivalence between the total number of customers in the system for the retrial queue and the total number of customers in the corresponding standard (non-retrial) queue. In this paper, under the assumption of regularly varying tails, we eliminate this condition by allowing that the service time can be either heavier or lighter than the batch size. The main contribution made in this paper is an asymptotic characterization of the difference between two tail probabilities: the probability of the total number of customers in the system for the $M^X/G/1$ retrial queue and the probability of the total number of customers in the corresponding standard (non-retrial) queue. The equivalence theorem by allowing a heavier batch size is another contribution in this paper.
Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: the retrial queueing systems with priority. This type of queueing system is important in various applications, including telecommunication and computer management networks with big data. For this type of system, we propose a detailed stochastic decomposition approach to study its asymptotic behaviour of the tail probability of the number of customers in the steady-state for retrial queues with two types (Type-1 and Type-2) of customers, in which Type-1 customers (in a queue) have non-preemptive priority to receive service over Type-2 customers (in an orbit). Under the assumption that the service times of Type-1 customers have a regularly varying tail and the service times of Type-2 customers have a tail lighter than Type-1 customers, we obtain tail asymptotic properties for the number of customers in the queue and in the orbit, respectively, conditional on the server's status, in terms of a detailed stochastic decomposition approach. Tail asymptotic properties are often used as key tools for approximating various performance metrics and constructing numerical algorithms for computations.