A graphical investigation of error bounds for moment-based queueing approximations (Q809486): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:16, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A graphical investigation of error bounds for moment-based queueing approximations |
scientific article |
Statements
A graphical investigation of error bounds for moment-based queueing approximations (English)
0 references
1991
0 references
The problems studied in this paper are basically the same as in the paper reviewed above. Here three performance measures are considered: the probability of delay of an arriving customer and the mean queue length in a G/M/1-queue in steady state, and finally for a GI/M/n/n loss system the probability that an arriving customer is blocked. As all three parameters depend monotonically on the Laplace transform of the interarrival time distribution, there are close connections in the behavior of moment-based approximations for them.
0 references
error bounds
0 references
moment matching
0 references
queueing approximations
0 references