Dynamic importance sampling for queueing networks
From MaRDI portal
Publication:2467605
Abstract: Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network setting (e.g., a two-node tandem network). Exploiting connections between importance sampling, differential games, and classical subsolutions of the corresponding Isaacs equation, we show how to design and analyze simple and efficient dynamic importance sampling schemes for general classes of networks. The models used to illustrate the approach include -node tandem Jackson networks and a two-node network with feedback, and the rare events studied are those of large queueing backlogs, including total population overflow and the overflow of individual buffers.
Recommendations
- Importance sampling for Jackson networks
- Importance sampling for a Markov modulated queuing network
- State-dependent importance sampling for a Jackson tandem network
- Efficient importance sampling schemes for a feed-forward network
- Subsolutions of an Isaacs Equation and Efficient Schemes for Importance Sampling
Cites work
- A quick simulation method for excessive backlogs in networks of queues
- A viscosity solution approach to the asymptotic analysis of queueing systems
- Analysis of an importance sampling estimator for tandem queues
- Analysis of state-independent importance-sampling measures for the two-node tandem queue
- Applied Probability and Queues
- Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/1 queue
- Dynamic importance sampling for uniformly recurrent Markov chains
- Fast simulation of rare events in queueing and reliability models
- scientific article; zbMATH DE number 1153603 (Why is no real title available?)
- Importance Sampling, Large Deviations, and Differential Games
- Large deviations for Markov processes with discontinuous statistics. I: General upper bounds
- Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue
- Neumann type boundary conditions for Hamilton-Jacobi equations
- Subsolutions of an Isaacs Equation and Efficient Schemes for Importance Sampling
- The interchangeability of ·/M/1 queues in series
Cited in
(38)- Importance sampling for a Markov modulated queuing network
- Splitting for rare event simulation: A large deviation approach to design and analysis
- Importance sampling algorithms for first passage time probabilities in the infinite server queue
- Approximation of the exit probability of a stable Markov modulated constrained random walk
- Excessive backlog probabilities of two parallel queues
- Splitting algorithms for rare event simulation over long time intervals
- Asymptotically optimal importance sampling for Jackson networks with a tree topology
- Importance sampling for non-Markovian tandem queues using subsolutions
- Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed \(G/G/1\) queue
- Large deviations and importance sampling for a tandem network with slow-down
- Alternative proof and interpretations for a recent state-dependent importance sampling scheme
- Approximation of bounds on mixed-level orthogonal arrays
- The convergence rate and asymptotic distribution of the bootstrap quantile variance estimator for importance sampling
- Importance Sampling for Weighted-Serve-the-Longest-Queue
- Importance sampling for metastable and multiscale dynamical systems
- Approximation of excessive backlog probabilities of two tandem queues
- An automatic adaptive importance sampling algorithm for molecular dynamics in reaction coordinates
- Quantitative differentiation: a general formulation
- Rare event simulation of small noise diffusions
- Importance Sampling, Large Deviations, and Differential Games
- Asymptotically optimal importance sampling for product-form queuing networks
- On efficiency of multilevel splitting
- ON STATE-INDEPENDENT IMPORTANCE SAMPLING FOR THE GI|GI|1 TANDEM QUEUE1
- Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes
- Analysis of a splitting estimator for rare event probabilities in Jackson networks
- Performance evaluation of an importance sampling technique in a Jackson network
- Instanton based importance sampling for rare events in stochastic pdes
- Moderate deviations-based importance sampling for stochastic recursive equations
- Subsolutions of an Isaacs Equation and Efficient Schemes for Importance Sampling
- Stochastic viscosity approximations of Hamilton–Jacobi equations and variance reduction
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- Efficient exponential tilting with applications
- Importance sampling for a simple Markovian intensity model using subsolutions
- The design and analysis of a generalized RESTART/DPR algorithm for rare event simulation
- State-dependent importance sampling for a slowdown tandem queue
- Hitting probabilities of constrained random walks representing tandem networks
- Escaping from an attractor: Importance sampling and rest points. I.
- Importance sampling for Jackson networks
This page was built for publication: Dynamic importance sampling for queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467605)
