Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue

DOI10.1287/mnsc.34.1.39zbMath0636.60102OpenAlexW2104726827MaRDI QIDQ3776355

Michael A. Zazanis, Rajan Suri

Publication date: 1988

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.34.1.39

zbMATH Keywords

perturbation analysisstrongly consistent estimatesparameter sensitivitiesapplications to optimization problemssensitivity of mean system time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (54)

Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis ⋮ Convergence of perturbation analysis based optimization algorithm with fixed number of customers period ⋮ Resource allocation for a stochastic CPM-type network through perturbation analysis ⋮ Genetic learning of dynamic scheduling within a simulation environment ⋮ Perturbation analysis of the \(GI/GI/1\) queue ⋮ Technical Note—On Estimating Quantile Sensitivities via Infinitesimal Perturbation Analysis ⋮ Comparison of gradient estimation techniques for queues with non- identical servers ⋮ Sample-path optimization of convex stochastic performance functions ⋮ Unnamed Item ⋮ Simulation methods of queues: An overview ⋮ Computing Sensitivities for Distortion Risk Measures ⋮ American Option Sensitivities Estimation via a Generalized Infinitesimal Perturbation Analysis Approach ⋮ Perturbation analysis of waiting times in the G/G/1 queue ⋮ Regression Models Augmented with Direct Stochastic Gradient Estimators ⋮ Optimizing uniform non-Markov queueing networks ⋮ Sensitivity analysis of ranked data: from order statistics to quantiles ⋮ Monte Carlo methods for sensitivity analysis of Poisson-driven stochastic systems, and applications ⋮ Consistency of perturbation analysis for a queue with finite buffer space and loss policy ⋮ Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis ⋮ An infinitesimal perturbation analysis algorithm for a multiclass G/G/1 queue ⋮ On the consistency of second derivative perturbation analysis estimators for the M/G/1 queue ⋮ Unnamed Item ⋮ Steady-state sample path derivative estimators ⋮ Strong consistency of sample path derivative estimates ⋮ Consistency of infinitesimal perturbation analysis estimators with rates ⋮ Strong consistency of infinitesimal perturbation analysis for tandem queueing networks ⋮ Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling ⋮ Full-state perturbation analysis of discrete event dynamic systems ⋮ Error analysis for regenerative queueing estimators with special reference to gradient estimators via likelihood ratio ⋮ Variance properties of sample path derivatives of parametric random variables ⋮ Bias properties of infinitesimal perturbation analysis for systems with parallel servers ⋮ Smoothed perturbation analysis for queues with finite buffers ⋮ Stationary waiting time derivatives ⋮ Maximal coupling and rare perturbation sensitivity analysis ⋮ Convergence rates for steady-state derivative estimators ⋮ Conditioning for variance reduction in estimating the sensitivity of simulations ⋮ Interchangeability of expectation and differentiation of waiting times in \(GI/G/1\) queues ⋮ Sensitivity estimates for portfolio credit derivatives using Monte Carlo ⋮ Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks ⋮ A two Timescale Stochastic Approximation Scheme for Simulation-Based Parametric Optimization ⋮ Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution ⋮ What you should know about simulation and derivatives ⋮ A Measure-Valued Differentiation Approach to Sensitivities of Quantiles ⋮ Optimization via simulation: A review ⋮ Sample path properties of the G/D/\(m\) queue ⋮ How to optimize discrete-event systems from a single sample path by the score function method ⋮ Perturbation analysis of discrete event systems: Concepts, algorithms, and applications ⋮ State-dependent control of a single stage hybrid system with Poisson arrivals ⋮ Perturbation analysis and Malliavin calculus ⋮ On derivative estimation of single-server queues via structural infinitesimal perturbation analysis ⋮ Stochastic dynamics simulation with generalized interval probability ⋮ Stationary IPA estimates for nonsmooth \(G/G/1/\infty\) functionals via Palm inversion and level-crossing analysis ⋮ Consistency of infinitesimal perturbation analysis for the GI/G/m queue ⋮ Robustness of perturbation analysis estimators for queueing systems with unknown distributions

This page was built for publication: Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue