Strong consistency of infinitesimal perturbation analysis for tandem queueing networks
From MaRDI portal
Publication:1180361
DOI10.1007/BF01797142zbMath0746.90025MaRDI QIDQ1180361
Publication date: 27 June 1992
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
stability; ergodicity; infinitesimal perturbation analysis; discrete event systems; tandem queueing networks
90B15: Stochastic network models in operations research
90B22: Queues and service in operations research
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Cites Work
- Unnamed Item
- The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence
- Consistency of infinitesimal perturbation analysis for the GI/G/m queue
- The stability of open queueing networks
- Infinitesimal and finite perturbation analysis for queueing networks
- Smoothed perturbation analysis for a class of piecewise constant sample performance functions
- Interchangeability of expectation and differentiation of waiting times in \(GI/G/1\) queues
- Sample path properties of the G/D/\(m\) queue
- Realization probability in closed Jackson queueing networks and its application
- Notes on the stability of closed queueing networks
- Stationary and stability of fork-join networks
- Performance evaluation and perturbation analysis of discrete event dynamic systems
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- Sensitivity analysis and optimization of throughput in a production line with blocking
- Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices
- Regenerative closed queueing networks
- On stability and performance of parallel processing systems
