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‎.

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results.

We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results. © 2005 Elsevier B.V. All rights reserved.

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 represent the classical Engset-loss model by the stochastic process counting the number of customers in the system. A fluid limit for this process is established for all the possible values of the various parameters of the system, as the number of servers tends to infinity along with the number of sources. Our results are derived through a semi-martingale decomposition method. A numerical ap...

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.

GERAN (GSM-EDGE Radio Access Network) operators have traditionally used the Erlang B formula to estimate the number of signalling channels on a per-cell basis. Thus, it is assumed that the network behaves as a loss system with Poisson arrivals. However, the presence of automatic retrial mechanisms and correlated arrivals in these channels suggests that these assumptions might not be valid. This...

This paper deals with a retrial queueing system with a finite number of homogeneous sources of calls and a single non-reliable server, which means that the server is subject to random breakdowns depending on whether it is busy or idle. The failure of the server may block or unblock the systems’s operations and the service of the interrupted request may be resumed or the call can be transmitted ...