A fast cross-entropy method for estimating buffer overflows in queueing networks
From MaRDI portal
Recommendations
- Fast simulation of buffer overflows in tandem networks of GI/GI/1 queues
- Optimally efficient estimation of the statistics of rare events in queueing networks
- Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy
- A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
- Importance sampling for Jackson networks
Cited in
(28)- Fast simulation of buffer overflows in tandem networks of GI/GI/1 queues
- \textit{KrigInv}: an efficient and user-friendly implementation of batch-sequential inversion strategies based on kriging
- A subset multicanonical Monte Carlo method for simulating rare failure events
- A resolution of St. Petersburg paradox
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- Excessive backlog probabilities of two parallel queues
- Asymptotically optimal importance sampling for Jackson networks with a tree topology
- Gaussian process surrogates for failure detection: a Bayesian experimental design approach
- Efficient rare event simulation for heavy-tailed systems via cross entropy
- A tutorial on the cross-entropy method
- Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy
- The cross-entropy method for network reliability estimation
- Importance sampling simulations of Markovian reliability systems using cross-entropy
- Large deviations and fast simulation in the presence of boundaries.
- Computation of credit portfolio loss distribution by a cross entropy method
- Fast regenerative simulation of overload probability of one-server queues
- Optimally efficient estimation of the statistics of rare events in queueing networks
- Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
- On the estimation of buffer overflow probabilities from measurements
- Efficient estimation of overflow probabilities in queues with breakdowns
- On probability estimation of buffer overflow for communication networks
- Marginal Likelihood Estimation with the Cross-Entropy Method
- The Impact of Queue Length Information on Buffer Overflow in Parallel Queues
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- Separation theorem for independent subspace analysis and its consequences
- A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
- Improved cross-entropy method for estimation
- Hitting probabilities of constrained random walks representing tandem networks
This page was built for publication: A fast cross-entropy method for estimating buffer overflows in queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114908)
