Overflow behavior in queues with many long-tailed inputs

DOI10.1239/AAP/1013540352MaRDI QIDQ2713162zbMATH OpenOpenAlexFDO

Authors M. R. H. Mandjes, Sem Borst

Publication date 10 June 2002

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/035652ee4f0191cec9ac39c510c626ab0a4ed5f9

zbMATH Keywords

buffer overflowlarge deviation asymptoticslong-tailed on periodsreduced load approximation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Review text

This paper is concerned with a fluid queue fed by \(n\) on-off sources which arrives at a buffered space \(bn\) having a constant depletion rate \(cn\). Explicit asymptotic results are obtained for the case where the on periods have a subexponential distribution, \(b\) being taken as large. These show a sharp dichotomy in behaviour depending on the behaviour of the function \(v(t) = -\log P(A^* > t)\) for large \(t\), \(A^*\) representing the residual on period. If \(v\) is regularly varying of index 0, the time to overflow will increase faster than the buffer size, while if the regular variation is of index strictly between 0 and 1, then the time to overflow is roughly proportional to the buffer size. Approximations are also obtained for the overflow probability.

Recommendations

• Patterns of buffer overflow in a class of queues with long memory in the input stream
• Fluid Queues with Heavy-Tailed M/G/∞ Input
• Overflow Asymptotics for large Communications Systems with General Markov Fluid Sources
• A note on queues with M/G/ input
• Fluid queues and regular variation

Cited in

(20)

• Asymptotic analysis of Lévy-driven tandem queues
• Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues
• Patterns of buffer overflow in a class of queues with long memory in the input stream
• Convexity properties of loss and overflow functions.
• Overflow and losses in a network queue with a self-similar input
• Overflow probability for a discrete-time queue with non-stationary multiplexed input
• Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows.
• Per-flow structure of losses in a finite-buffer queue
• Loss asymptotics in large buffers fed by heterogeneous long-tailed sources
• On the overflow time of a fluid model
• Overflow probability upper bound in fluid queues with general on-off sources
• A Note on the Benefits of Buffering
• Exact overflow asymptotics for queues with many Gaussian inputs
• Generalized processor sharing queues with heterogeneous traffic classes
• A fluid queue with a finite buffer and subexponential input
• A large deviations analysis of the transient of a queue with many Markov fluid inputs: approximations and fast simulation
• Network decomposition in the many-sources regime
• Overflow Asymptotics for large Communications Systems with General Markov Fluid Sources
• A note on queues with M/G/ input
• Heavy loads and heavy tails

This page was built for publication: Overflow behavior in queues with many long-tailed inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713162)