Retrial queue

About: Retrial queue is a research topic. Over the lifetime, 784 publications have been published within this topic receiving 12354 citations.

Analysis of repairable M (X) /(G 1 ,G 2 )/1 - feedback retrial G-queue with balking and starting failures under at most J vacations

Abstract: In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of services and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them get into the orbit. The negative customer, is arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters the orbit or leaves the system. If the orbit is empty at the service completion of each type of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. While the busy server may breakdown at any instant and the service channel may fail for a short interval of time. The steady state probability generating function for the system size is obtained by using the supplementary variable method. Numerical illustrations are discussed to see the effect of the system parameters.

Asymptotic analysis of the tails of queue length in M/G/1 retrial queue with batch arrival

Abstract: In this paper,we study the tail behavior of the stationary queue length of an M/G/1 retrial queue which is batch arrived and have subexponential service time by using stochastic decomposition.Then we obtain the correlation between the stationary queue length tail distribution of an M/G/1 retrial queue with batch arrival and the stationary queue length tail distribution in the corresponding standard M/G/1 queue with batch arrival.Our results for subexponential tails also can be applied to regularly varying tails.Therefore,we get the regularly varying tail asymptotics for the stationary queue length.

MAP/PH/1 Retrial Queue with Abandonment, Flush Out and Search of Customers

Abstract: This paper considers a single server retrial queueing system with search, abandonment and flush out of customers from the system (system clearance) periodically with exponentially distributed duration. A customer on arrival, enters for service, if the server is found to be idle and enter into an orbit of infinite capacity if the server is busy. Orbital customers receive service either by successful retrials or by an orbital search. At the epoch of completion of a service, sever goes for search with probability p as long as the orbit size is atmost L-1. Search stops the moment there are L or more customers in the orbit. Further orbital customers are assumed to renege with certain probability on an unsuccessful retrial. In addition, clearance of system takes place each time a random duration following exponential distribution, expires. The customers arrive to the system according to Markovian arrival Process, inter-retrial times are exponentially distributed and service time follows phase type distribution. We analyze the resulting GI/M/1 Type queue. Steady-state analysis of the model is performed. Some performance measures are evaluated.