Analysis of an importance sampling estimator for tandem queues
From MaRDI portal
Publication:4876026
DOI10.1145/203091.203093zbMath0841.62083OpenAlexW2162407085MaRDI QIDQ4876026
Publication date: 15 July 1996
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/tomacs/
Markov chainsasymptotic efficiencyqueueing networksarrival raterare-event probabilityimportance sampling estimatorsmallest service ratetandem Jackson networks
Related Items
Importance sampling techniques for the multidimensional ruin problem for general Markov additive sequences of random vectors ⋮ Importance sampling for Jackson networks ⋮ ON STATE-INDEPENDENT IMPORTANCE SAMPLING FOR THE GI|GI|1 TANDEM QUEUE1 ⋮ Rare-event analysis and simulation of queues with time-varying rates ⋮ Importance Sampling for Metastable and Multiscale Dynamical Systems ⋮ Approximation of excessive backlog probabilities of two tandem queues ⋮ Large deviations for the total queue size in non-Markovian tandem queues ⋮ Counterexamples in importance sampling for large deviations probabilities ⋮ The cross-entropy method with patching for rare-event simulation of large Markov chains ⋮ Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes ⋮ Efficient rare-event simulation for perpetuities ⋮ Excessive backlog probabilities of two parallel queues ⋮ Asymptotics of overflow probabilities in Jackson networks. ⋮ On asymptotically efficient simulation of large deviation probabilities ⋮ State-dependent importance sampling for a slowdown tandem queue ⋮ Alternative proof and interpretations for a recent state-dependent importance sampling scheme ⋮ Editorial: rare-event simulation for queues ⋮ Dynamic importance sampling for queueing networks ⋮ Performance evaluation of an importance sampling technique in a Jackson network ⋮ Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy ⋮ Asymptotically optimal importance sampling for Jackson networks with a tree topology ⋮ Dynamic importance sampling for uniformly recurrent Markov chains ⋮ State-dependent importance sampling for regularly varying random walks ⋮ Importance sampling for a Markov modulated queuing network ⋮ Splitting for rare event simulation: A large deviation approach to design and analysis ⋮ Importance sampling for non-Markovian tandem queues using subsolutions ⋮ Escaping from an attractor: Importance sampling and rest points. I. ⋮ Optimization of computer simulation models with rare events ⋮ Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks ⋮ Asymptotics of first passage times for random walk in an orthant ⋮ Large deviations and fast simulation in the presence of boundaries. ⋮ Approximation of the exit probability of a stable Markov modulated constrained random walk
