How hard are steady-state queueing simulations?

DOI10.1145/2749460MaRDI QIDQ4635230zbMATH OpenOpenAlexFDO

Authors Eric Cao Ni, Shane G. Henderson

Publication date 16 April 2018

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2749460

zbMATH Keywords

asymptotic variancediffusion approximationsMarkovian queues

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queues and service in operations research (90B22)

Recommendations

• Planning Queueing Simulations
• Simulation run lengths to estimate blocking probabilities
• Simulation methods of queues: An overview
• Queueing Simulation in Heavy Traffic
• Improved Design of Queueing Simulation Experiments with Highly Heteroscedastic Responses

Cited in

(5)

• Simulation methods of queues: An overview
• Transaction tagging in highly congested queueing simulations
• The Efficiency of One Long Run Versus Independent Replications in Steady-State Simulation
• Simulation run lengths to estimate blocking probabilities
• Planning Queueing Simulations

This page was built for publication: How hard are steady-state queueing simulations?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635230)