Simulation run lengths to estimate blocking probabilities
From MaRDI portal
Recommendations
Cited in
(14)- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
- Rare event simulation for a slotted time M/G/s model
- One-dimensional reflected diffusions with two boundaries and an inverse first-hitting problem
- The Stationary Distributions of Two Classes of Reflected Ornstein–Uhlenbeck Processes
- On the time-dependent moments of Markovian queues with reneging
- Asymptotic Formulas for Markov Processes with Applications to Simulation
- Variance Reduction in Simulations of Loss Models
- How hard are steady-state queueing simulations?
- Planning Queueing Simulations
- Hitting time in Erlang loss systems with moving boundaries
- On the Generalized Drift Skorokhod Problem in One Dimension
- On the transition densities for reflected diffusions
- A note on the central limit theorem for the idleness process in a one‐sided reflected Ornstein–Uhlenbeck model
- Limit theorems for reflected Ornstein-Uhlenbeck processes
This page was built for publication: Simulation run lengths to estimate blocking probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575327)