Sergey Foss, Dmitry Korshunov
Published 2013-03-19Version 1
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 are given for the probability ${\bf P}\{W>x\}$. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary queue length. These asymptotics depend heavily on the traffic load.
Journal: Queueing Systems, 52 (2006), No.1, 31--48
On Long Range Percolation with Heavy Tails
Simple and explicit bounds for multi-server queues with universal 1 / (1 - rho) scaling
On importance sampling with mixtures for random walks with heavy tails
![QR code for arXiv:1303.4705 [math.PR]](http://oss.arxitics.com/images/favicon.svg)