Waiting-time tail probabilities in queues with long-tail service-time distributions (Q1331293)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 622033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Waiting-time tail probabilities in queues with long-tail service-time distributions |
scientific article; zbMATH DE number 622033 |
Statements
Waiting-time tail probabilities in queues with long-tail service-time distributions (English)
0 references
2 February 1995
0 references
The authors have recently developed algorithms for the waiting-time tail probabilities \(P (W>x)\) in a large class of single-server queues [Oper. Res (1994), and Commun. Stat., Stochastic Models 10, No. 1, 99-143 (1994; Zbl 0801.60082)]. In this paper, the authors consider a \(GI/G/1\) queueing model assuming that the service time distribution is a Pareto mixture of exponential distribution with mean 1. They develop algorithms for computing the waiting-time distribution. They investigate the quality of approximations based on asymptotics for \(P (W>x)\), as \(x\to\infty\). They also derive multi-term asymptotic expansions for the \(M/G/1\) queue.
0 references
Pollachek contour integrals
0 references
waiting-time tail probabilities
0 references
queues
0 references
Pareto mixture of exponential distribution
0 references
waiting-time distribution
0 references
0 references
0 references
0.8716129064559937
0 references
0.8694474101066589
0 references
0.8339775800704956
0 references
0.8339775800704956
0 references
0.8333069682121277
0 references
