178 research outputs found
A sufficient condition for the subexponential asymptotics of GI/G/1-type Markov chains with queueing applications
The main contribution of this paper is to present a new sufficient condition
for the subexponential asymptotics of the stationary distribution of a
GI/GI/1-type Markov chain without jumps from level "infinity" to level zero.
For simplicity, we call such Markov chains {\it GI/GI/1-type Markov chains
without disasters} because they are often used to analyze semi-Markovian queues
without "disasters", which are negative customers who remove all the customers
in the system (including themselves) on their arrivals. In this paper, we
demonstrate the application of our main result to the stationary queue length
distribution in the standard BMAP/GI/1 queue. Thus we obtain new asymptotic
formulas and prove the existing formulas under weaker conditions than those in
the literature. In addition, applying our main result to a single-server queue
with Markovian arrivals and the -bulk-service rule (i.e., MAP//1 queue), we obatin a subexponential asymptotic formula for the
stationary queue length distribution.Comment: Submitted for revie
Tail asymptotics for cumulative processes sampled at heavy-tailed random times with applications to queueing models in Markovian environments
This paper considers the tail asymptotics for a cumulative process sampled at a heavy-tailed random time . The main contribution of
this paper is to establish several sufficient conditions for the asymptotic
equality as , where and is a certain
positive constant. The main results of this paper can be used to obtain the
subexponential asymptotics for various queueing models in Markovian
environments. As an example, using the main results, we derive subexponential
asymptotic formulas for the loss probability of a single-server finite-buffer
queue with an on/off arrival process in a Markovian environment
Importance sampling of heavy-tailed iterated random functions
We consider a stochastic recurrence equation of the form , where ,
and is an i.i.d. sequence of positive random
vectors. The stationary distribution of this Markov chain can be represented as
the distribution of the random variable . Such random variables can be found in the analysis of
probabilistic algorithms or financial mathematics, where would be called a
stochastic perpetuity. If one interprets as the interest rate at
time , then is the present value of a bond that generates unit of
money at each time point . We are interested in estimating the probability
of the rare event , when is large; we provide a consistent
simulation estimator using state-dependent importance sampling for the case,
where is heavy-tailed and the so-called Cram\'{e}r condition is not
satisfied. Our algorithm leads to an estimator for . We show that under
natural conditions, our estimator is strongly efficient. Furthermore, we extend
our method to the case, where is defined via the
recursive formula and
is a sequence of i.i.d. random Lipschitz functions
Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations
In this paper, asymptotic properties of the loss probability are considered
for an M/G/1/N queue with server vacations and exhaustive service discipline,
denoted by an M/G/1/N -(V, E)-queue. Exact asymptotic rates of the loss
probability are obtained for the cases in which the traffic intensity is
smaller than, equal to and greater than one, respectively. When the vacation
time is zero, the model considered degenerates to the standard M/G/1/N queue.
For this standard queueing model, our analysis provides new or extended
asymptotic results for the loss probability. In terms of the duality
relationship between the M/G/1/N and GI/M/1/N queues, we also provide
asymptotic properties for the standard GI/M/1/N model
- β¦