Efficient simulation of buffer overflow probabilities in Jackson networks with feedback
DOI10.1145/1113316.1113317zbMATH Open1390.90224OpenAlexW2094909089WikidataQ131114865 ScholiaQ131114865MaRDI QIDQ4565359FDOQ4565359
Authors: S. Juneja, Victor F. Nicola 
Publication date: 12 June 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/1113316.1113317
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
importance samplingvariance reductionJackson networksqueueing networksasymptotic optimalityrare event simulation
Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)
Cited In (10)
- On probability estimation of buffer overflow for communication networks
- Optimal sampling of overflow paths in Jackson networks
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- Excessive backlog probabilities of two parallel queues
- Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks
- Analysis of a splitting estimator for rare event probabilities in Jackson networks
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- Approximation of excessive backlog probabilities of two tandem queues
- Asymptotics of overflow probabilities in Jackson networks.
- Recurrence times of buffer overflows 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)
