Elsevier

Operations Research Letters

Volume 40, Issue 6, November 2012, Pages 537-540
Operations Research Letters

Exact tail asymptotics for the M/M/m retrial queue with nonpersistent customers

https://doi.org/10.1016/j.orl.2012.09.004Get rights and content

Abstract

We consider the M/M/m retrial queue with nonpersistent customers. Liu et al. (2011) [12] provided the asymptotic lower and upper bounds for the stationary distribution of the number of customers in the orbit. In this paper we strengthen Liu, Wang and Zhao’s result by finding the exact tail asymptotic formula.

Introduction

Retrial queues are queueing systems in which arriving customers who find all servers occupied may retry for service again after a random amount of time. Retrial queues have been widely used to model many problems in telephone systems, call centers, telecommunication networks, computer networks and computer systems, and in daily life. Detailed overviews for retrial queues can be found in the bibliographies [1], [2], [3], the surveys [6], [11], [15], and the books [4], [7].

Multi-server retrial queues are characterized by the following feature: if there is a free server when a customer arrives from outside the system, this customer begins to be served immediately and leaves the system after the service is completed. On the other hand, any customer who finds all servers busy upon arrival joins a retrial group, called an orbit, and then attempts service after a random amount of time. If there is a free server when a customer from the orbit attempts service, this customer receives service immediately and leaves the system after the service completion. Otherwise the customer comes back to the orbit immediately and repeats the retrial process.

We consider the M/M/m retrial queue with nonpersistent customers. For this queueing system, when m>1, there is no explicit closed form expression for the stationary distribution of the number of customers in the orbit and the number of busy servers. On the other hand, the standard M/M/m retrial queue does not have explicit closed form expression for the stationary distribution, when m>2. Therefore, tail asymptotic analysis for the stationary distribution of the queue length (i.e., the number of customers in the orbit) has attracted a lot of interest and has become more important. Tail asymptotic analysis for the stationary distribution of the queue length in single server retrial queues can be found in [10], [8], [14] and references therein.

For the standard M/M/m retrial queue, tail asymptotics for the stationary distribution of the queue length have been studied by Liu and Zhao [13] and Kim et al. [9]. Liu and Zhao [13] provided the asymptotic lower and upper bounds for the stationary distribution of the queue length. More precisely, Liu and Zhao [13] found the decay function h̃i(n) satisfying 0<lim infnπnih̃i(n)lim supnπnih̃i(n)<, where πni,n0,i=0,1,,m, is the joint probability that there are n customers in the orbit and i busy servers, in the steady state. Kim et al. [9] obtained the exact tail asymptotic formula limnπnih̃i(n)=c̃i!(νμ)i,i=0,1,,m, with a constant c̃>0, service rate μ and retrial rate ν.

This paper focuses on the tail asymptotics for the stationary distribution of the queue length in the M/M/m retrial queue with nonpersistent customers. Liu et al. [12] obtained the same formula as in (1), but with a different decay function hi(n) from h̃i(n): 0<lim infnπnihi(n)lim supnπnihi(n)<.

The main contribution of this paper is that we find the following exact tail asymptotic formula for the stationary distribution πni of the queue length: limnπnihi(n)=ci!(νμ)i,i=0,1,,m, with a constant c>0. Obviously our result strengthens Liu et al.’s result.

Section snippets

The M/M/m retrial queue with nonpersistent customers

We consider the M/M/m retrial queue with nonpersistent customers. Customers arrive from outside the system according to a Poisson process with rate λ. The service facility consists of m identical servers, and service times are exponentially distributed with mean μ1. The retrial time, i.e., the length of the time interval between two consecutive attempts made by a customer in the orbit, is exponentially distributed with mean ν1. The arrival process, the service times, and the retrial times are

Exact tail asymptotics

In this section we present exact tail asymptotic formula for πni as n. As mentioned in the introduction, we state the result of Liu et al. [12] as the following lemma.

Lemma 1

Liu et al. [12]

The stationary probabilities πni,i=0,1,,m, satisfy0<lim infnπnihi(n)lim supnπnihi(n)<,wherehi(n)=1n!(λp(1q)ν)nnmμ(1q)νm+i.

We present our main theorem, whose proof is deferred to the end of this section.

Theorem 1

There exists c>0 such thatlimnπnihi(n)=ci!(νμ)i,i=0,1,,m,where hi(n) is given by (2).

Before proving the theorem,

Acknowledgments

B. Kim’s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2011-0004133). J. Kim’s research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2012-0004219).

References (15)

There are more references available in the full text version of this article.

Cited by (0)

View full text