Infinitesimal and finite perturbation analysis for queueing networks
From MaRDI portal
Publication:1051557
DOI10.1016/0005-1098(83)90060-2zbMath0514.90028OpenAlexW2175202650MaRDI QIDQ1051557
Christos G. Cassandras, Yu-Chi Ho, Cao, Xiren
Publication date: 1983
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(83)90060-2
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (28)
Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis ⋮ Generalized estimates for performance sensitivities of stochastic systems ⋮ Generalized sensitivity analysis of ergodic stochastic systems ⋮ A New Likelihood Ratio Method for Training Artificial Neural Networks ⋮ Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations ⋮ Uniformization and performance sensitivity estimation in closed queueing networks ⋮ Robust event-triggered distributed fusion for multi-sensor systems with unknown failure rates ⋮ Performance optimization of queueing systems with perturbation realization ⋮ Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system ⋮ Strong consistency of infinitesimal perturbation analysis for tandem queueing networks ⋮ Full-state perturbation analysis of discrete event dynamic systems ⋮ Applications of generalized likelihood ratio method to distribution sensitivities and steady-state simulation ⋮ Sensitivity analysis of serial transfer lines using finite perturbation analysis ⋮ Policy iteration for customer-average performance optimization of closed queueing systems ⋮ Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks ⋮ Sensitivity analysis of a manufacturing workstation using perturbation analysis techniques ⋮ Distributed fusion in wireless sensor networks based on a novel event-triggered strategy ⋮ Stochastic approximation algorithms: overview and recent trends. ⋮ Optimization via simulation: A review ⋮ Unnamed Item ⋮ Perturbation analysis of discrete event systems: Concepts, algorithms, and applications ⋮ Sensitivity calculation of the throughput of an FMS with rspect to the routing mix using perturbation analysis ⋮ Perturbation analysis and Malliavin calculus ⋮ On derivative estimation of single-server queues via structural infinitesimal perturbation analysis ⋮ Infinitesimal and finite perturbation analysis for queueing networks ⋮ On the perturbation analysis of discrete-event dynamic systems ⋮ ``What-if analysis in computer simulation models: A comparative survey with some extensions ⋮ Robustness of perturbation analysis estimators for queueing systems with unknown distributions
Cites Work
This page was built for publication: Infinitesimal and finite perturbation analysis for queueing networks
