English
Related papers

Related papers: Tail Asymptotics for a Retrial Queue with Bernoull…

200 papers

When an explicit expression for a probability distribution function $F(x)$ can not be found, asymptotic properties of the tail probability function $\bar{F}(x)=1-F(x)$ are very valuable, since they provide approximations or bounds for…

Probability · Mathematics 2019-04-16 Bin Liu , Yiqiang Q. Zhao

Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: the retrial queueing systems with priority. This type of queueing system is…

Probability · Mathematics 2019-01-17 Bin Liu , Yiqiang Q. Zhao

We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…

Probability · Mathematics 2018-01-23 Joris Walraevens , Dieter Claeys , Tuan Phung-Duc

In the literature, retrial queues with batch arrivals and heavy service times have been studied and the so-called equivalence theorem has been established under the condition that the service time is heavier than the batch size. The…

Probability · Mathematics 2020-08-13 Bin Liu , Jie Min , Yiqiang Q. Zhao

We investigate the tail behaviour of the steady state distribution of a stochastic recursion that generalises Lindley's recursion. This recursion arises in queuing systems with dependent interarrival and service times, and includes…

Probability · Mathematics 2014-04-23 Maria Vlasiou , Zbigniew Palmowski

We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of…

Probability · Mathematics 2015-05-19 Yang Song , Zaiming Liu , Yiqiang Q. Zhao

We consider a single-server GI/GI/1 queueing system with feedback. We assume the service times distribution to be (intermediate) regularly varying. We find the tail asymptotics for a customer's sojourn time in two regimes: the customer…

Probability · Mathematics 2018-08-01 Sergey Foss , Masakiyo Miyazawa

In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time $W$ in the $GI/GI/2$ FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics…

Probability · Mathematics 2013-03-20 Sergey Foss , Dmitry Korshunov

We study the asymptotics of the stationary sojourn time Z of a "typical customer" in a tandem of single-server queues. It is shown that, in a certain "intermediate" region of light-tailed service time distributions, Z may take a large value…

Probability · Mathematics 2011-11-29 S. G. Foss

This paper considers the tail asymptotics for a cumulative process $\{B(t); t \ge 0\}$ sampled at a heavy-tailed random time $T$. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality…

Probability · Mathematics 2013-12-30 Hiroyuki Masuyama

We obtain asymptotic bounds for the tail distribution of steady-state waiting time in a two server queue where each server processes incoming jobs at a rate equal to the rate of their arrivals (that is, the half-loaded regime). The job…

Probability · Mathematics 2016-04-05 Jose Blanchet , Karthyek Murthy

In this paper, we consider a discrete-time preemptive priority queue with different service rates for two classes of customers, one with high-priority and the other with low-priority. This model corresponds to the classical preemptive…

Probability · Mathematics 2014-10-30 Yang Song , Zaiming Liu , Hongshuai Dai

In this paper, we provide a review on the kernel method, which is one of the options for characterizing so-called exact tail asymptotic properties in stationary probabilities of two-dimensional random walks, discrete or continuous (or…

Probability · Mathematics 2021-01-29 Yiqiang Q. Zhao

We consider Markovian multiserver retrial queues where a blocked customer has two opportunities for abandonment: at the moment of blocking or at the departure epoch from the orbit. In this queueing system, the number of customers in the…

Probability · Mathematics 2014-06-17 Tuan Phung-Duc

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn

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…

Probability · Mathematics 2012-05-01 Yuanyuan Liu , Yiqiang Zhao

A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework contains several classical queueing network models, including generalized…

Probability · Mathematics 2007-05-23 Marc Lelarge

We are interested in a large queue in a $GI/G/k$ queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a…

Probability · Mathematics 2017-03-10 Masakiyo Miyazawa

In this paper we are concerned with a sample of asymptotically independent risks. Tail asymptotic probabilities for linear combinations of randomly weighted order statistics are approximated under various assumptions, where the individual…

Probability · Mathematics 2014-06-24 Alexandru V. Asimit , Enkelejd Hashorva , Dominik Kortschak

Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…

Probability · Mathematics 2011-04-08 Mariana Olvera-Cravioto , Jose Blanchet , Peter Glynn
‹ Prev 1 2 3 10 Next ›