How to measure the accuracy of the subexponential approximation for the stationary single server queue

Authors:
Dmitry Korshunov
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia 630090
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 3
Cited 0

Asymptotic expansions for waiting time probabilities in an M/G/1 queue with long-tailed service time

Queueing Systems: Theory and Applications
Tails of waiting times and their bounds

Queueing Systems: Theory and Applications
On upper bounds for the tail distribution of geometric sums of subexponential random variables

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the problem of establishing an upper bound for the distribution tail of the stationary waiting time D in the GI/GI/1 FCFS queue.