A Note on the Benefits of Buffering
The note deals with a queueing system fed by a large number \(n\) of Gaussian sources and emptied at constant service rate \(nc\). The large deviation asymptotic of the (tail) probability of the overflow of a buffer level \(b\) is considered. A duality relation between the shape of the rate function \(I\) and correlation structure of the input is obtained. A key notion is the most likely duration \(t(b)\) of a busy period preceding overflow over buffer level \(nb\) (time-scale overflow). The main result is that the decay rate function \(I(b)\) at some buffer size \(b\) is convex (concave) if and only if the sources exibit negative (positive) correlation on the time scale \(t(b)\). A few models (e.g. fBM, periodic arrivals, Ornstein-Uhlenbeck input) are discussed and numerical examples are also included.
- Large Deviations for Complex Buffer Architectures: The Short-Range Dependent Case
- Queueing Networks with Gaussian Inputs
- Overflow behavior in queues with many long-tailed inputs
- Buffer overflow asymptotics for a buffer handling many traffic sources
- Patterns of buffer overflow in a class of queues with long memory in the input stream
This page was built for publication: A Note on the Benefits of Buffering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451555)