Perturbation analysis of waiting times in the G/G/1 queue
From MaRDI portal
Publication:373009
DOI10.1007/s10626-012-0144-0zbMath1278.60139OpenAlexW2023054927MaRDI QIDQ373009
Arie Hordijk, Haralambie Leahu, Bernd F. Heidergott
Publication date: 21 October 2013
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-012-0144-0
Sensitivity, stability, parametric optimization (90C31) Queueing theory (aspects of probability theory) (60K25) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (4)
Sensitivity analysis of ranked data: from order statistics to quantiles ⋮ A tutorial on event-based optimization -- a new optimization framework ⋮ Policy Gradient Approach of Event‐Based Optimization and Its Online Implementation ⋮ Service rate control of closed Jackson networks from game theoretic perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong bounds on perturbations
- On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method
- A perturbation analysis approach to phantom estimators for waiting times in the \(G/G/1\) queue
- Measure-valued differentiation for Markov chains
- Weak Differentiability of Product Measures
- Max-Plus Linear Stochastic Systems and Perturbation Analysis
- Infinitesimal Perturbation Analysis Estimates for Moments of the System Time of an M/M/1 Queue
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- Convergence Properties of Infinitesimal Perturbation Analysis Estimates
- Gradient estimation for discrete-event systems by measure-valued differentiation
- Likelihood ratio gradient estimation for stochastic recursions
- Regenerative derivatives of regenerative sequences
- Measure-Valued Differentiation for Stationary Markov Chains
- Perturbation theory and finite Markov chains
- On the quasi-stationary distribution of the virtual waiting time in queues with Poisson arrivals
This page was built for publication: Perturbation analysis of waiting times in the G/G/1 queue