Consistency of perturbation analysis for a queue with finite buffer space and loss policy (Q912055): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Performance evaluation and perturbation analysis of discrete event dynamic systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the <i>M</i>/<i>G</i>/1 Queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interchangeability of expectation and differentiation of waiting times in \(GI/G/1\) queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Consistency of infinitesimal perturbation analysis for the GI/G/m queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Realization probability in closed Jackson queueing networks and its application / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of parameter sensitivity estimates in a stochastic experiment / rank | |||
Normal rank |
Revision as of 15:22, 20 June 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
0 references
0 references