Queueing systems with heavy tails
asymptotic behaviour of the workload distributionfluid queueheavy-tailed inputsingle-server queuessteady-state sojourn-time distribution
Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Queueing theory (aspects of probability theory) (60K25) Iterative numerical methods for linear systems (65F10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Communication networks in operations research (90B18) Queues and service in operations research (90B22)
The first chapter of the monograph serves as a general introduction to motivate the analysis of queueing systems with heavy-tailed input. Chapter 2 gives an introduction to heavy-tailed distributions, treats some basic results for queueing systems with heavy tails, and gives some heuristics for constructing a proof. Chapter 3 contains results for the steady-state sojourn-time distribution of the M/G/1 processing sharing queue. The main result obtained here is the following: the tails of the service- and sojourn-time distribution are equally heavy. A fluid queue with a finite buffer is considered in Chapter 4. Chapter 5 investigates busy-period asymptotics in single-server queues. The central subject of investigation of Chapters 6 and 7 is the fluid queue fed by a finite number of on-off sources with heavy-tailed on- and/or off-periods, and possibly some additional light-tailed input. Both chapters focus on the asymptotic behaviour of the workload distribution, Chapter 8 considers fluid queues with heavy-tailed M/G/\(\infty\) input.
- Steady-state distribution of the buffer content for \(\text{M}/\text{G}/\infty\) input fluid queues
- Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues
- Fluid Queues with Heavy-Tailed M/G/∞ Input
- Fluid queues and regular variation
- Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows.
- Asymptotic analysis of Lévy-driven tandem queues
- On a generic class of two-node queueing systems
- A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input
- Customer sojourn time in \(GI/GI/1\) feedback queue in the presence of heavy tails
- Subexponential asymptotics of hybrid fluid and ruin models
- Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows.
- Infinite markings method in queueing systems with the infinite variance of service time
- Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed \(G/G/1\) queue
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Probabilistic Relation between In-Degree and PageRank
- Asymptotic analysis for personalized web search
- State-dependent importance sampling for regularly varying random walks
- Efficient simulation and conditional functional limit theorems for ruinous heavy-tailed random walks
- scientific article; zbMATH DE number 1487764 (Why is no real title available?)
- Two queues with random time-limited polling
- Robustness of power-law behavior in cascading line failure models
- PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS
- Finite-pool queueing with heavy-tailed services
- Minimization of Packet Loss Probability in Network with Fractal Traffic
- Methods of simulation queueing systems with heavy tails
- Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance
- A note on product-convolution for generalized subexponential distributions
- Estimation of prioritized disciplines efficiency based on the metamodel of multi-flows queueing systems
- Heavy loads and heavy tails
- Fork-join and redundancy systems with heavy-tailed job sizes
- Jumping Fluid Models and Delay Stability of Max-Weight Dynamics Under Heavy-Tailed Traffic
- On maxima of stationary delay in the \({M/G/2}\) systems
- Tail asymptotics of fluid queues in a distributed server system fed by a heavy-tailed ON-OFF flow
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- Processor sharing: a survey of the mathematical theory
This page was built for publication: Queueing systems with heavy tails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760877)
