Bounds for Design Parameters in Queues (Q4024151)
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 108716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for Design Parameters in Queues |
scientific article; zbMATH DE number 108716 |
Statements
Bounds for Design Parameters in Queues (English)
0 references
25 February 1993
0 references
probability of first passage for extreme values
0 references
numerical examples
0 references
0 references
0 references
0.8882086
0 references
0.88462067
0 references
0.8842325
0 references
0.8839742
0 references
0.88396585
0 references
0.8803472
0 references
The authors purport to obtain bounds on and approximations to the probability of first passage for extreme values over a given number of periods, as applied to single server queues with Poisson arrivals and exponential service. The calculations found in the paper are elementary, and are directly based on standard results. There is considerably conceptual confusion on the definition of symbols and the meaning of the computations; the latter also simultaneously mix time, number, and discrete period parameters. Two numerical examples are offered to suggest design choices that avoid extreme values over a specified number of periods with a designated probability.
0 references