How to measure the accuracy of the subexponential approximation for the stationary single server queue
From MaRDI portal
Publication:383190
DOI10.1007/s11134-011-9243-0zbMath1275.60083MaRDI QIDQ383190
Publication date: 25 November 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-011-9243-0
large deviations; heavy tails; lower and upper bounds; subexponential distribution; accuracy of approximation; FCFS single server queue; integrated tail distribution; long tailed distribution; stationary waiting time
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- On upper bounds for the tail distribution of geometric sums of subexponential random variables
- Estimates for the probability of ruin with special emphasis on the possibility of large claims
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Asymptotic behaviour of Wiener-Hopf factors of a random walk
- Waiting-time tail probabilities in queues with long-tail service-time distributions
- Asymptotically correct bounds of geometric convolutions with subexponential components
- Tails of waiting times and their bounds
- On distribution tail of the maximum of a random walk
- Second-order asymptotics for the ruin probability in the case of very large claims
- An Introduction to Heavy-Tailed and Subexponential Distributions
- Asymptotic Analysis of Random Walks
- On the tails of waiting-time distributions
- Applied Probability and Queues
