Logarithmic Asymptotics For Steady-State Tail Probabilities In A Single-Server Queue (1993)
| Citations: | 132 - 14 self |
BibTeX
@MISC{Glynn93logarithmicasymptotics,
author = {Peter W. Glynn and Ward Whitt},
title = {Logarithmic Asymptotics For Steady-State Tail Probabilities In A Single-Server Queue},
year = {1993}
}
Years of Citing Articles
OpenURL
Abstract
We consider the standard single-server queue with unlimited waiting space and the first-in first-out service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steady-state waiting-time distribution to have small-tail asymptotics of the form x - 1 logP(W > x) - q * as x for q * > 0. We require only stationarity of the basic sequence of service times minus interarrival times and a Ga .. rtnerEllis condition for the cumulant generating function of the associated partial sums, i.e., n - 1 log Ee qS n y(q) as n , plus regularity conditions on the decay rate function y. The asymptotic decay rate q * is the root of the equation y(q) = 0. This result in turn implies a corresponding asymptotic result for the steady-state workload in a queue with general nondecreasing input. This asymptotic result covers the case of multiple independent sources, so that it provides additional theoretical support for a concept of effective bandwidths for admission control in multi-class queues based on asymptotic decay rates.







