A quick simulation method for excessive backlogs in networks of queues
From MaRDI portal
Recommendations
Cited in
(44)- A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
- Counterexamples in importance sampling for large deviations probabilities
- Editorial: rare-event simulation for queues
- Networks with cascading overloads
- Performance evaluation of an importance sampling technique in a Jackson network
- Large deviations for Markov processes with discontinuous statistics. II: Random walks
- Sample path large deviations and intree networks
- Optimal importance sampling for Markovian systems with applications to tandem queues
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- Large deviations of Jackson networks.
- State-independent importance sampling for random walks with regularly varying increments
- Simulating tail asymptotics of a Markov chain
- Excessive backlog probabilities of two parallel queues
- Parallel simulation of statistical multiplexers
- Optimization of computer simulation models with rare events
- Stationary tail probabilities in exponential server tandems with renewal arrivals
- Finding the conjugate of Markov fluid processes
- Rate-tilting for fast simulation of level/phase processes
- Alternative proof and interpretations for a recent state-dependent importance sampling scheme
- Analysis of a splitting estimator for rare event probabilities in Jackson networks
- Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy
- Ordinal optimization approach to rare event probability problems
- Importance sampling for Jackson networks
- scientific article; zbMATH DE number 4107891 (Why is no real title available?)
- Some recent results in rare event estimation
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- Fast simulation of buffer overflows in tandem networks of GI/GI/1 queues
- A cross-entropy scheme for mixtures
- Approximation of bounds on mixed-level orthogonal arrays
- Approximation of excessive backlog probabilities of two tandem queues
- Fast simulation of networks of queues with effective and decoupling bandwidths
- Rare-event simulation for neural network and random forest predictors
- Asymptotics of first passage times for random walk in an orthant
- Asymptotically optimal importance sampling for Jackson networks with a tree topology
- Asymptotics of overflow probabilities in Jackson networks.
- ON STATE-INDEPENDENT IMPORTANCE SAMPLING FOR THE GI|GI|1 TANDEM QUEUE1
- Importance sampling for non-Markovian tandem queues using subsolutions
- A class of optimum importance sampling strategies
- scientific article; zbMATH DE number 1129912 (Why is no real title available?)
- Efficient simulation of large deviation events for sums of random vectors using saddle-point representations
- Some Large Deviations Results in Markov Fluid Models
- State-dependent importance sampling for a slowdown tandem queue
- Dynamic importance sampling for queueing networks
- Importance sampling for a Markov modulated queuing network
This page was built for publication: A quick simulation method for excessive backlogs in networks of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3810654)
