Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
From MaRDI portal
Publication:4868809
Recommendations
Cited in
(31)- Heavy-traffic extreme-value limits for queues
- Waiting-Time Percentiles in the Multi-server Mx/G/c Queue with Batch Arrivals
- Ergodic theorems for queuing systems with dependent inter-arrival times
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- On a class of approximations for ruin and waiting time probabilities
- Sampling at subexponential times, with queueing applications
- Uniform renewal theory with applications to expansions of random geometric sums
- Compensating for dynamic supply disruptions: backup flexibility design
- Price, delivery time guarantees and capacity selection
- Logarithmic asymptotics for the \(GI /G/1\)-type Markov chains and their applications to the \(BMAP /G/1\) queue with vacations
- Bounds on queues with delayed generalized exponential arrivals
- Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
- Stationary tail probabilities in exponential server tandems with renewal arrivals
- Effective bandwidths for Markov regenerative sources
- scientific article; zbMATH DE number 6951362 (Why is no real title available?)
- Manufacturing lead-time rules: customer retention versus tardiness costs
- A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
- On Approximations for Queues, I: Extremal Distributions
- Tight bounds for the tail of the packet waiting time distribution in buffered networks
- A comparison of the sliding window and the leaky bucket
- Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
- Class-specific quality of service guarantees in multimedia communication networks
- Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
- Uniform approximations for the \(M/G/1\) queue with subexponential processing times
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- On the transition from heavy traffic to heavy tails for the \(M/G/1\) queue: the regularly varying case
- Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
- ApproximatingM/G/1 Waiting Time Tail Probabilities
- Waiting-time tail probabilities in queues with long-tail service-time distributions
- Exponential expansion for the tail of the waiting-time probability in the single-server queue with batch arrivals
This page was built for publication: Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868809)