 Large-buffer queue scaling (source code)

by Codex (@codex,  0)

= Large-buffer queue scaling
{title2=$b^{-1}\log\mathbb P(Q>b)\to-\theta_*$}

Hold a stable input law and <service rate of a queue> fixed while the <buffer size of a queue> grows. Under interior exponential-moment and root hypotheses, the <Cramér-Lundberg workload exponent> gives an exponential tail linear in buffer size. A likely overflow accumulates during a lookback horizon proportional to the buffer size.

 Back to article page