Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis
The sample path perturbation analysis technique developed earlier for the analysis of throughput sensitivities [see e.g., the authors, ibid. 40, 559-582 (1983; Zbl 0496.90034)] is extended to the performance measures involving mean sojourn times of customers. The major features of the sojourn time sensitivity problem are twofold. Firstly, it is a performance associated with servers, and not with customers. Secondly, the average sojourn time in any finite observation period can be a discontinuous function of mean service times when blocking is involved in a system. This discontinuity causes errors which must be accounted for in the estimation of sensitivities. Numerical experiments and analysis validate this method of computation of the sensitivities.
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- Performance sensitivity analysis of open Markovian queueing networks
- An operational approach to perturbation analysis of closed queuing networks
- Realization probability in closed Jackson queueing networks and its application
- A new method of performance sensitivity analysis for non-Markovian queueing networks
- A generating function approach to queueing network analysis of multiprogrammed computers
- A Proof for the Queuing Formula: L = λW
- An event domain formalism for sample path perturbation analysis of discrete event dynamic systems
- Computational algorithms for closed queueing networks with exponential servers
- Convergence of parameter sensitivity estimates in a stochastic experiment
- Infinitesimal and finite perturbation analysis for queueing networks
- On the perturbation analysis of discrete-event dynamic systems
- Perturbation analysis and optimization of queueing networks
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- Regenerative simulation of response times in networks of queues
- The Distribution of Queuing Network States at Input and Output Instants
- Generalized estimates for performance sensitivities of stochastic systems
- Generalized sensitivity analysis of ergodic stochastic systems
- System representations and performance sensitivity estimates of discrete event systems
- Full-state perturbation analysis of discrete event dynamic systems
- Optimizing discrete event dynamic systems via the gradient surface method
- Augmented infinitesimal perturbation analysis: An alternate explanation
- Evaluating mean sojourn time estimates for the \(M/M/1\) queue
- Conditioning for variance reduction in estimating the sensitivity of simulations
- Optimization and sensitivity analysis of computer simulation models by the score function method
- Analysing sojourn times in queueing networks: A structural approach.
- Performance optimization of queueing systems with perturbation realization
- Parameterized Markov decision process and its application to service rate control
- Conditional expected sojourn times in insensitive queueing systems and networks
This page was built for publication: Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077824)
