This paper introduces the retrial CPP/M/c queue, which is the generalization of the M/M/c retrial queue. The arrival process of jobs into the queue follows the Compound Poisson Process (CPP). We present an efficient and numerically stable computational algorithm for the steady state probabilities.

We consider an M/G/1 retrial queue, where the service time distribution has a regularly varying tail with index −β, 1 < β < 2. It is shown that the waiting time distribution has a regularly varying tail with index 1− β, and the pre-factor is determined explicitly. The result is obtained by comparing the waiting time in the M/G/1 retrial queue with the waiting time in the ordinary M/G/1 queue wi...

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.

In this paper, we introduce a retrial queueing problem for wireless cellular networks applying the Fractional Guard Channel (FGC) admission control policy and propose a new algorithm to solve the retrial queue problem involving the FGC policy. Comparison between analytical and simulation results shows that our algorithm is accurate and fast to evaluate the performance of the system.

An M/G/1 retrial queueing system with breakdowns have been studied in fuzzy environment. The arrival rate,retrial rate, service rate,failure rate and repair rate of server are all fuzzy numbers. For this model we obtain some system characteristics such as mean orbit size ,mean normal queue size and mean system size. The α cut approach is used to transform fuzzy queues with an unreliable server ...

The aim of this paper is to investigate a multiserver retrial queueing system with a finite number of heterogeneous sources of calls. The novelty of the investigation is the heterogeneity of the sources, that is every source is characterized by different arrival, retrial and service rates. All random variables involved in the model construction are assumed to be exponentially distributed and in...

Retrial queueing systems are characterized by the fact that a primary request, finding all servers and waiting positions busy upon arrival, leaves the service area but after some random time, repeats its demand. Between retrials, the customer is said to be in “Orbit”. So the repeated attempts for service from the group of blocked customers are super imposed on the normal stream of arrivals of p...

In this paper, we analyze and synthesize a multi-server loss system with repeated customers, arising out of NTT DoCoMo-developed telecommunication networks. We first provide the numerical solution for a Markovian model with exponential retrial intervals. Applying Little’s formula, we derive the main system performance measures (blocking probability and mean waiting time) for general non-Markovi...

Retrial queueing models are often used for the performance and reliability modeling of computer systems and communication networks. The reason is that the return of customers plays a special role in many of these systems as well as in other practical applications, and it has a nonneglectable negative effect on the performance measures. For some applications of retrial queues, see, for example, ...