Topic
Retrial queue
About: Retrial queue is a research topic. Over the lifetime, 784 publications have been published within this topic receiving 12354 citations.
Papers published on a yearly basis
Papers
More filters
15 Jan 2019
2 citations
TL;DR: In this article , the authors studied the asymptotic behavior of the tail probability of the number of customers in the steady-state M/G/1 retrial queue with Bernoulli schedule, under the assumption that the service time distribution has a regularly varying tail.
Abstract: In this paper, we study the asymptotic behaviour of the tail probability of the number of customers in the steady-state M/G/1 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.
2 citations
27 Jan 2021
TL;DR: In this paper, a single server multi-class retrial model, feed by Poisson input, is considered under classical retrial policy, while inter-retrial times are class dependent and generally distributed.
Abstract: We deal with a single server multi-class retrial model, feed by Poisson input. The system is considered under classical retrial policy, while inter-retrial times are class dependent and generally distributed. Such systems have various applications like multi-access protocols or cellular mobile networks, where blocked messages are sent again after some waiting period. We rely on regenerative approach and results from renewal theory to obtain the stability criterion of the system under consideration and present some simulation results, to illustrate that obtained condition could be extended to the case with general input.
2 citations
TL;DR: In this article , the authors developed a single-server queueing model with service retrials for the cognitive radio network (CRN), which is motivated by the rapid growth in wireless communication systems, and derived the optimal joining strategy from the perspective of a social planner.
2 citations
TL;DR: The system size distribution at a departure epoch and the probability generating function of the joint distributions of the server state and orbit size are derived and proved, and the decomposition property is proved.
Abstract: This paper deals with the steady state behaviour of an Mx/G/1 retrial queue with two successive phases of service and general retrial times under Bernoulli vacation schedule for an unreliable server. While the server is working with any phase of service, it may breakdown at any instant and the service channel will fail for a short interval of time. The primary customers finding the server busy, down, or on vacation are queued in the orbit in accordance with first come, first served (FCFS) retrial policy. After the completion of the second phase of service, the server either goes for a vacation of random length with probability p or may serve the next unit, if any, with probability (1 - p). For this model, we first obtain the condition under which the system is stable. Then, we derive the system size distribution at a departure epoch and the probability generating function of the joint distributions of the server state and orbit size, and prove the decomposition property.
2 citations