Retrial queue

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

A Discrete-Time Geo/G/1 Retrial Queue with Bernoulli Vacation and Second Optional Service

Abstract: We analyze a discrete-time Geo/G/1retrial queue with Bernoulli vacation where all the arriving customers require a first essential service while only some of them demand a second optional service.If upon arrival,the server is busy or vacation,the customer is obliged to leave the service area and to orbit.Each customer in the orbit forms an independent retrial source and the retrial time follows a geometrical law.Just after completion of a customer's service the server may take a vacation of random length or may opt to continue staying in the system to serve the next customer.We study the Markov chain underlying the considered queuing system and some performance measures of the system in steady-state.Further,we give two stochastic decomposition laws and some examples.

An m2/g2/1 retrial queue with priority customers, 2 nd optional service and linear retrial policy

Abstract: We analyze an M2/G2/1 retrial queuing system with two types of customers and linear retrial policy. If any arriving customer finds the server idle, then it begins his service immediately. Blocked customers from the first flow are queued in order to be served; whereas blocked customers from the second flow leave the service area, but after some random amount of time they repeat an attempt to get service. After essential service completion, a customer either may abandon the system forever or may immediately ask for a second service. The essential and optional service times are arbitrarily and exponentially distributed respectively. We study the ergodicity of the embedded Markov chain, its stationary distribution function and the joint generating function of the number of customers in both groups in the steady-state regime.

The m/g/1 feedback retrial queue with bernoulli schedule

Abstract: We consider an M/G/1 feedback retrial queue with Bernoulli schedule in which after being served each customer either joins the retrial group again or departs the system permanently. Using the supplementary variable method, we obtain the joint generating function of the numbers of customers in two groups.

Approximation of M/G/c Retrial Queue with M/PH/c Retrial Queue

Abstract: The sensitivity of the performance measures such as the mean and the standard deviation of the queue length and the blocking probability with respect to the moments of the service time are numerically investigated. The service time distribution is fitted with phase type(PH) distribution by matching the first three moments of service time and the M/G/c retrial queue is approximated by the M/PH/c retrial queue. Approximations are compared with the simulation results.