Consistency of perturbation analysis for a queue with finite buffer space and loss policy (Q912055): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:00, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Consistency of perturbation analysis for a queue with finite buffer space and loss policy |
scientific article |
Statements
Consistency of perturbation analysis for a queue with finite buffer space and loss policy (English)
0 references
1991
0 references
The subject of discrete-event dynamical systems has taken on a new direction with the advent of perturbation analysis (PA), an efficient method of estimating the gradients of a steady-state performance measure, by analyzing data obtained from a single-simulation experiment in the time domain. A crucial issue is whether PA gives strongly consistent estimates, namely, whether average time-domain-based gradients converge, over infinite horizon, to the steady-state gradients. In this paper, we investigate this issue for a queue with a finite buffer capacity and a loss policy. The performance measure in question is the average amount of lost customers, as a function of the buffer's capacity, which is assumed to be continuous in our work. It is shown that PA gives strongly consistent estimates. The analysis uses a new technique, based on busy period-dependent inequalities. This technique may have possible extensions to analyses of consistency of PA for more general queueing systems.
0 references
discrete-event dynamical systems
0 references
perturbation analysis
0 references
queue
0 references