Efficient simulation of buffer overflow probabilities in Jackson networks with feedback
From MaRDI portal
Publication:4565359
Recommendations
- Importance sampling for Jackson networks
- Asymptotically optimal importance sampling for Jackson networks with a tree topology
- Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks
- Optimal sampling of overflow paths in Jackson networks
- State-dependent importance sampling for a Jackson tandem network
Cited in
(10)- Excessive backlog probabilities of two parallel queues
- Analysis of a splitting estimator for rare event probabilities in Jackson networks
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- On probability estimation of buffer overflow for communication networks
- Approximation of excessive backlog probabilities of two tandem queues
- Optimal sampling of overflow paths in Jackson networks
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- Asymptotics of overflow probabilities in Jackson networks.
- Recurrence times of buffer overflows in Jackson networks
- Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks
This page was built for publication: Efficient simulation of buffer overflow probabilities in Jackson networks with feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565359)