Realization probabilities. The dynamics of queuing systems
performance sensitivityparametric sensitivitygeneralized semi-Markov processesclosed Jackson networksoptimization problems in queueing theoryqueueing system theorysensitivity in some networkssteady-state performance sensitivity formulas
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Markov renewal processes, semi-Markov processes (60K15)
- Realization factors and sensitivity analysis of queueing networks with state-dependent service rates
- Realization probability in closed Jackson queueing networks and its application
- Sensitivity formulas of performance in closed state-dependent queueing networks
- Performance sensitivity analysis of open Markovian queueing networks
- Sensitivity analysis of general performance measures of queueing networks with state-dependent service rates
- Performance optimization of queueing systems with perturbation realization
- Relations between performance potentials and infinitesimal realization factors in closed queueing networks
- What you should know about simulation and derivatives
- Sensitivity analysis of regenerative queuing models
- A perturbation analysis approach to phantom estimators for waiting times in the \(G/G/1\) queue
- Realization factors and sensitivity analysis of queueing networks with state-dependent service rates
- Realization probability in multi-class closed queueing networks
- Service rate control of closed Jackson networks from game theoretic perspective
- Applications of generalized likelihood ratio method to distribution sensitivities and steady-state simulation
- Perturbation analysis of discrete event systems: Concepts, algorithms, and applications
- Real-Time Reconstruction of a Counting Process Through First-Come-First-Serve Queue Systems
- Sensitivity formulas of performance in closed state-dependent queueing networks
- Measure-valued differentiation for Markov chains
- Basic ideas for event-based optimization of Markov systems
- Policy iteration for customer-average performance optimization of closed queueing systems
- A tutorial on event-based optimization -- a new optimization framework
- Calculation of sensitivities of throughputs and realization probabilities in closed queueing networks with finite buffer capacities
- scientific article; zbMATH DE number 4069994 (Why is no real title available?)
- A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
- scientific article; zbMATH DE number 3476427 (Why is no real title available?)
- A unified approach to Markov decision problems and performance sensitivity analysis
- A neural network approach to performance analysis of tandem lines: the value of analytical knowledge
- The Dynamics and the Uncertainty of Queues at Fixed and Actuated Controls: A Probabilistic Approach
- A linear algebraic formulation of the performance sensitivities of queueing networks
- An overview for Markov decision processes in queues and networks
- Performance optimization for a class of generalized stochastic Petri nets
- Realization probability in closed Jackson queueing networks and its application
This page was built for publication: Realization probabilities. The dynamics of queuing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313415)
