Large deviation asymptotics for busy periods
Ken R. Duffy, Sean P. Meyn
Stochastic Systems · 2014
doi:10.1214/13-ssy098 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The busy period for a queue is cast as the area swept under the random walk until it first returns to zero. Encompassing non-i.i.d. increments, the large-deviations asymptotics of the busy period B is addressed, under the assumption that the increments satisfy standard conditions, including a negative drift. The main conclusions provide insight on the probability of a large busy period, and the manner in which this occurs. The scaled probability of a large busy period has the asymptote, for any b > 0, \begin{align*} \lim_{n\to\infty} \frac{1}{\sqrt{n}} \log P(B\geq bn) = -K\sqrt{b}, \end{align*} where \begin{align*} K = 2 \sqrt{-\int_0^{\lambda^*} \Lambda(\theta) \, d\theta}\,, \quad \hbox{with}\ \lambda^*=\sup\{\theta:\Lambda(\theta)\leq0\}, \end{align*} and with Λ denoting the scaled cumulant generating function of the increments process. The most likely path to a large swept area is found to be a simple rescaling of the path on [0, 1] given by ψ*(t) = −Λ(λ*(1 − t))/λ*. In contrast to the piecewise linear most likely path leading the random walk to hit a high level, this is strictly concave in general. While these two most likely paths have distinctly different forms, their derivatives coincide at the start of their trajectories, and at their first return to zero.<br/> These results partially answer an open problem of Kulick and Palmowski [18] regarding the tail of the work done during a busy period at a single server queue. The paper concludes with applications of these results to the estimation of the busy period statistics (λ*,K) based on observations of the increments, offering the possibility of estimating the likelihood of a large busy period in advance of observing one.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.