The Annals of Applied Probability

Dynamic importance sampling for queueing networks

Paul Dupuis, Ali Devin Sezer, and Hui Wang

Full-text: Open access


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 d-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.

Article information

Ann. Appl. Probab., Volume 17, Number 4 (2007), 1306-1346.

First available in Project Euclid: 10 August 2007

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60F10: Large deviations 65C05: Monte Carlo methods
Secondary: 49N90: Applications of optimal control and differential games [See also 90C90, 93C95]

Importance sampling tandem queueing networks Isaacs equation subsolutions asymptotic optimality


Dupuis, Paul; Sezer, Ali Devin; Wang, Hui. Dynamic importance sampling for queueing networks. Ann. Appl. Probab. 17 (2007), no. 4, 1306--1346. doi:10.1214/105051607000000122.

Export citation


  • Asmussen, S. (1982). Conditioned limit theorems relating a random walk to its associates, with applications to risk reverse process and $GI/G/1$ queue. Adv. in Appl. Probab. 14 143–170.
  • Asmussen, S. (2003). Applied Probability and Queues. Spring, New York.
  • De Boer, P. J. (2006). Analysis of state-independent importance sampling measures for the two-node tandem queue. ACM Trans. Modeling Comp. Simulation 16 225–250.
  • Dupuis, P. and Ellis, R. S. (1997). A Weak Convergence Approach to the Theory of Large Deviations. Wiley, New York.
  • Dupuis, P., Ellis, R. S. and Weiss, A. (1991). Large deviations for Markov processes with discontinuous statistics, I: General upper bounds. Ann. Probab. 19 1280–1297.
  • Dupuis, P., Ishii, H. and Soner, H. M. (1990). A viscosity solution approach to the asymptotic analysis of queueing systems. Ann. Probab. 18 226–255.
  • Dupuis, P. and Wang, H. (2004). Importance sampling, large deviations, and differential games. Stoch. Stoch. Rep. 76 481–508.
  • Dupuis, P. and Wang, H. (2005). Dynamic importance sampling for uniformly recurrent Markov chains. Ann. Appl. Probab. 15 1–38.
  • Dupuis, P. and Wang, H. (2007). Subsolutions of an Isaacs equation and efficient schemes for importance sampling. Math. Oper. Res. To appear.
  • Glasserman, P. and Kou, S. (1995). Analysis of an importance sampling estimator for tandem queues. ACM Trans. Modeling Comp. Simulation. 4 22–42.
  • Heidelberger, P. (1995). Fast simulation of rare events in queueing and reliability models. ACM Trans. Modeling Comp. Simulation 4 43–85.
  • Lions, P.-L. (1985). Neumann type boundary conditions for Hamilton–Jacobi equations. Duke Math. J. 52 793–820.
  • Parekh, S. and Walrand, J. (1989). A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Automat. Control 34 54–66.
  • Sadowsky, J. S. (1991). Large deviations and efficient simulation of excessive backlogs in a $GI/G/m$ queue. IEEE Trans. Automat. Control 36 1383–1394.
  • Sezer, A. D. (2005). Dynamic importance sampling for queueing networks. Ph.D. dissertation, Brown Univ.
  • Weber, R. R. (1979). The interchangeability in $\cdot/M/1$ queues in series. J. Appl. Probab. 16 690–695.