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
TL;DR: In this paper, the authors consider retrial queues with servers that are subject to active breakdowns and give an algorithm to compute the steady-state probabilities for the M/G/l retrial queue with breakdowns.
Abstract: We consider retrial queues with servers that are subject to active breakdowns. First, we concentrate on Markovian queueing models. For the multiserver case we obtain sufficient conditions for ergodicity. For the singleserver case we introduce new performance measures: the “orbit” idle period and the “orbit” busy period. Further, we investigate the asymptotic behaviour under high intensity of retrials. We also give an algorithm to compute the steady-state probabilities for the M/G/l retrial queue with breakdowns. The algorithm is based on a regenerative approach.
56 citations
TL;DR: In this paper, the expected waiting times for the customers of two types who arrive in batches (in a compound Poisson fashion) at a single-server queueing station with no waiting room were derived.
Abstract: Expressions are derived for the expected waiting times for the customers of two types who arrive in batches (in a compound Poisson fashion) at a single-server queueing station with no waiting room. Those who cannot get served immediately keep returning to the system after random exponential amounts of time until they get served. The result is shown to agree with similar results for three special cases studied in the literature.
53 citations
TL;DR: The closed form solution in equilibrium for the retrial M/M/1 queue with working vacations is derived, and it is shown that the conditional stochastic decomposition holds for this model as well.
Abstract: In this paper we introduce the new M/M/1 retrial queue with working vacations which is motivated by the performance analysis of a Media Access Control function in wireless systems. We give a condition for the stability of the model, which has an important impact on setting the retrial rate for such systems. We derive the closed form solution in equilibrium for the retrial M/M/1 queue with working vacations, and we also show that the conditional stochastic decomposition holds for this model as well.
52 citations
TL;DR: Through the Particle Swarm Optimization (PSO) algorithm, the optimal solution of the social welfare maximization problem is numerically obtained and the individual equilibrium strategies are compared with the social optimum and the Price of Anarchy is studied as a measure to quantify the inefficiency of the equilibrium strategies.
52 citations
TL;DR: In this article, the authors considered the retrial group of finite capacity and geometric loss and derived the joint distribution of two queue lengths, the waiting time distribution and the distribution of the busy period from these results, they obtained the blocking probability, the mean waiting time, and the mean queue lengths.
52 citations