English
Related papers

Related papers: Heavy tails in multi-server queues

200 papers

In this paper, we study the maximum waiting time $\max_{i\leq N}W_i(\cdot)$ in an $N$-server fork-join queue with heavy-tailed services as $N\to\infty$. The service times are the product of two random variables. One random variable has a…

Probability · Mathematics 2022-11-07 Dennis Schol , Maria Vlasiou , Bert Zwart

We consider a two dimensional reflecting random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary of the quadrant, but may have unbounded jumps in the opposite direction,…

Probability · Mathematics 2014-06-24 Masahiro Kobayashi , Masakiyo Miyazawa

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, which was first introduced to derive the stability region for stochastic…

Probability · Mathematics 2017-11-29 Francois Baccelli , Sergey Foss

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

Significant correlations between arrivals of load-generating events make the numerical evaluation of the workload of a system a challenging problem. In this paper, we construct highly accurate approximations of the workload distribution of…

Probability · Mathematics 2014-05-02 Eleni Vatamidou , Ivo J. B. F. Adan , Maria Vlasiou , Bert Zwart

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

For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…

Probability · Mathematics 2020-07-28 Dmitry Korshunov

We study tail behaviour of the distribution of the area under the positive excursion of a random walk which has negative drift and heavy-tailed increments. We determine the asymptotics for tail probabilities for the area.

Probability · Mathematics 2019-07-03 Denis Denisov , Elena Perfilev , Vitali Wachtel

We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its…

Probability · Mathematics 2007-05-23 Misja Nuyens , Bert Zwart

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

Probability · Mathematics 2014-01-17 Yunan Liu , Ward Whitt

We consider a Markov chain on $R^+$ with asymptotically zero drift and finite second moments of jumps which is positive recurrent. A power-like asymptotic behaviour of the invariant tail distribution is proven; such a heavy-tailed invariant…

Probability · Mathematics 2012-08-16 Denis Denisov , Dmitry Korshunov , Vitali Wachtel

We consider the sums $S_n=\xi_1+\cdots+\xi_n$ of independent identically distributed random variables. We do not assume that the $\xi$'s have a finite mean. Under subexponential type conditions on distribution of the summands, we find the…

Probability · Mathematics 2013-03-20 D. Denisov , S. Foss , D. Korshunov

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…

Statistical Mechanics · Physics 2011-12-30 S. I. Denisov , S. B. Yuste , Yu. S. Bystrik , H. Kantz , K. Lindenberg

We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits.…

Probability · Mathematics 2010-03-31 Qiang Zhen , Charles Knessl

This paper investigates the asymptotic behavior of higher-order conditional tail moments, which quantify the contribution of individual losses in the event of systemic collapse. The study is conducted within a framework comprising two…

Probability · Mathematics 2025-05-27 Zhangting Chen , Bingjie Wang , Dongya Cheng

In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…

Probability · Mathematics 2007-05-23 Misja Nuyens

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

Let $X_{1},\ldots ,X_{n}$ be $n$ real-valued dependent random variables. With motivation from Mitra and Resnick (2009), we derive the tail asymptotic expansion for the weighted sum of order statistics $X_{1:n}\leq \cdots \leq X_{n:n}$ of…

Probability · Mathematics 2014-08-07 Enkelejd Hashorva , Jinzhi Li

The so-called partition function is a sample moment statistic based on blocks of data and it is often used in the context of multifractal processes. It will be shown that its behaviour is strongly influenced by the tail of the distribution…

Methodology · Statistics 2013-10-02 Danijel Grahovac , Mofei Jia , Nikolai N. Leonenko , Emanuele Taufer

We are concerned with an $M/M$-type join the shortest queue ($M/M$-JSQ for short) with $k$ parallel queues for an arbitrary positive integer $k$, where the servers may be heterogeneous. We are interested in the tail asymptotic of the…

Probability · Mathematics 2013-04-30 Masahiro Kobayashi , Yutaka Sakuma , Masakiyo Miyazawa