Infinitesimal and finite perturbation analysis for queueing networks

DOI10.1016/0005-1098(83)90060-2zbMath0514.90028MaRDI QIDQ1051557

Cao, Xiren, Christos G. Cassandras, Yu-Chi Ho

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

zbMATH Keywords

queueing networks; sample-path perturbation analysis technique

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

90B10: Deterministic network models in operations research

Related Items

Sensitivity analysis of a manufacturing workstation using perturbation analysis techniques, Unnamed Item, Strong consistency of infinitesimal perturbation analysis for tandem queueing networks, Full-state perturbation analysis of discrete event dynamic systems, Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks, 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, Robustness of perturbation analysis estimators for queueing systems with unknown distributions, Optimization via simulation: A review, On derivative estimation of single-server queues via structural infinitesimal perturbation analysis, Uniformization and performance sensitivity estimation in closed queueing networks