Heavy tails in multi-server queues
Probability
2013-03-20 v1
Abstract
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time in the FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the probability . 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.
Cite
@article{arxiv.1303.4705,
title = {Heavy tails in multi-server queues},
author = {Sergey Foss and Dmitry Korshunov},
journal= {arXiv preprint arXiv:1303.4705},
year = {2013}
}