Analysis of Multiserver Retrial Queueing System: A Martingale Approach and an Algorithm of Solution

The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon arrival all servers are busy, then the customer goes to the secondary queue, orbit, and after some random time retries more and more to occupy a server. A service time of each customer is exponentially distributed random variable with parameter $\mu_1$. A time between retrials is exponentially distributed with parameter $\mu_2$ for each customer. Using a martingale approach the paper provides an analysis of this system. The paper establishes the stability condition and studies a behavior of the limiting queue-length distributions as $\mu_2$ increases to infinity. As $\mu_2\to\infty$, the paper also proves the convergence of appropriate queue-length distributions to those of the associated `usual' multiserver queueing system without retrials. An algorithm for numerical solution of the equations, associated with the limiting queue-length distribution of retrial systems, is provided.Comment: To appear in "Annals of Operations Research" 141 (2006) 19-52. Replacement corrects a small number of misprint

An M/G/1 Retrial Queue with Single Working Vacation

We consider an M=G=1 retrial queue with general retrial times and single working vacation. During the working vacation period, customers can be served at a lower rate. Both service times in a vacation period and in a service period are generally distributed random variables. Using supplementary variable method we obtain the probability generating function for the number of customers and the average number of customers in the orbit. Furthermore, we carry out the waiting time distribution and some special cases of interest are discussed. Finally, some numerical results are presented

Stability Condition of a Retrial Queueing System with Abandoned and Feedback Customers

This paper deals with the stability of a retrial queueing system with two orbits, abandoned and feedback customers. Two independent Poisson streams of customers arrive to the system, and flow into a single-server service system. An arriving one of type i; i = 1; 2, is handled by the server if it is free; otherwise, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. The customer in the orbit either attempts service again after a random time or gives up receiving service and leaves the system after a random time. After the customer is served completely, the customer will decide either to join the retrial group again for another service or leave the system forever with some probability

(R1971) Analysis of Feedback Queueing Model with Differentiated Vacations under Classical Retrial Policy

This paper analyzes an M/M/1 retrial queue under differentiated vacations and Bernoulli feedback policy. On receiving the service, if the customer is not satisfied, then he may join the retrial group again with some probability and demand for service or may leave the system with the complementary probability. Using the probability generating functions technique, the steady-state solutions of the system are obtained. Furthermore, we have obtained some of the important performance measures such as expected orbit length, expected length of the system, sojourn times and probability of server being in different states. Using MATLAB software, we have represented the graphical interpretation of the results obtained. Finally, the cost is optimized using the parabolic method

On a batch arrival queuing system equipped with a stand-by server during vacation periods or the repairs times of the main server

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Hindawi PublishingWe study a queuing system which is equipped with a stand-by server in addition to the main server. The stand-by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden failure from time to time. The service times, vacation times, and repair times are assumed to follow general arbitrary distributions while the stand-by service times follow exponential distribution. Supplementary variables technique has been used to obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue while the MathCad software has been used to illustrate the numerical results in this work

Analysis of Two Stage M[X1],M[X2]/G1,G2/1 Retrial G-queue with Discretionary Priority Services, Working Breakdown, Bernoulli Vacation, Preferred and Impatient Units

In this paper, we study M[X1] , M[X2] /G1 ,G2 /1 retrial queueing system with discretionary priority services. There are two stages of service for the ordinary units. During the first stage of service of the ordinary unit, arriving priority units can have an option to interrupt the service, but, in the second stage of service it cannot interrupt. When ordinary units enter the system, they may get the service even if the server is busy with the first stage of service of an ordinary unit or may enter into the orbit or leave the system. Also, the system may breakdown at any point of time when the server is in regular service period. During the breakdown period, the interrupted priority unit will get the fresh service at a slower rate but the ordinary unit can not get the service and the server will go for repair immediately. During the ordinary unit service period, the arrival of negative unit will interrupt the service and it may enter into an orbit or leave the system. After completion of each priority unit’s service, the server goes for a vacation with a certain probability. We allow reneging to happen during repair and vacation periods. Using the supplementary variable technique, the Laplace transforms of time-dependent probabilities of system state are derived. From this, we deduce the steady-state results. Also, the expected number of units in the respective queues and the expected waiting times, are computed. Finally, the numerical results are graphically expressed