• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.351-373
• /
• 2020

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method.

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.623-649
• /
• 2017

Retrial queues have been widely used to model the many practical situations arising from telephone systems, telecommunication networks and call centers. An approximation method for a simple Markovian retrial queue by reducing the two dimensional problem to one dimensional problem was presented by Fredericks and Reisner in 1979. The method seems to be a promising approach to approximate the retrial queues with complex structure, but the method has not been attracted a lot of attention for about thirty years. In this paper, we exposit the method in detail and show the usefulness of the method by presenting the recent results for approximating the retrial queues with complex structure such as multi-server retrial queues with phase type distribution of retrial time, impatient customers with general persistent function and/or multiclass customers, etc.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.481-493
• /
• 1996

We consider a retrial queue with two classes of customers where arrivals of class 1(resp. class 2) customers are MMPP and Poisson process, respectively. In the case taht arriving customers are blocked due to the channel being busy, the class 1 customers are queued in priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrial group in order to try service again after a random amount of time. We consider the following retrial rate control policy, which reduces their retrial rate as more customers join the retrial group; their retrial times are inversely proportional to the number of customers in the retrial group. We find the joint generating function of the numbers of custormers in the two groups by the supplementary variable method.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.803-811
• /
• 2011

We present an algorithmic solution for the stationary distribution of the M/M/c retrial queue in which the retrial times of each customer in orbit are of phase type distribution of order 2. The system is modeled by the level dependent quasi-birth-and-death (LDQBD) process.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.173-196
• /
• 2021

This paper treats a retrial queue with phase type retrial times and a threshold type-policy, where each server is subject to breakdowns and repairs. Upon a server failure, the customer whose service gets interrupted will be handed over to another available server, if any; otherwise, the customer may opt to join the retrial orbit or depart from the system according to a Bernoulli trial. We analyze such a multi-server retrial queue using the recently introduced threshold-based retrial times for orbiting customers. Applying the matrix-analytic method, we carry out the steady-state analysis and report a few illustrative numerical examples.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.311-325
• /
• 2013

The effects of the moments of the interarrival time and service time on the system performance measures such as blocking probability, mean and standard deviation of the number of customers in service facility and orbit are numerically investigated. The results reveal the performance measures are more sensitive with respect to the interarrival time than the service time. Approximation for $GI/G/c$ retrial queues using $PH/PH/c$ retrial queue is presented.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.503-525
• /
• 1998

In the theory of retrial queues it is usually assumed that the flow of primary customers is Poisson. This means that the number of independent sources, or potential customers, is infinite and each of them generates primary arrivals very seldom. We consider now retrial queueing systems with a homogeneous population, that is, we assume that a finite number K of identical sources generates the so called quasi-random input. We present a survey of the main results and mathematical tools for finite source retrial queues, concentrating on M/G/1//K and M/M/c//K systems with repeated attempts.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.259-266
• /
• 2009

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.

• Communications for Statistical Applications and Methods
• /
• v.19 no.1
• /
• pp.169-175
• /
• 2012

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.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.