Asymptotic Behavior of a Multiplexer Fed by a Long-Range Dependent Process
Abstract
In this paper we study the asymptotic behavior of the tail of the stationary backlog distribution in a single server queue with constant service capacity c, fed by the so-called «$M/G/\infty$ input process» or «Cox input process». Asymptotic lower bounds are obtained for any distribution $G$ and asymptotic upper bounds are derived when $G$ is a subexponential distribution. We find the bounds to be tight in some instances, e.g., $G$ corresponding to either the Pareto or lognormal distribution and $c-\rho<1$, where $\rho$ is the arrival rate to the buffer.
Loading...