Skip to main content
Log in

Importance Sampling for Continuous Time Markov Chains and Applications to Fluid Models*

  • Published:
Methodology And Computing In Applied Probability Aims and scope Submit manuscript

Abstract

In this paper we determine the asymptotically efficient change of intensity for some problems of Monte Carlo simulation involving a finite state continuous time Markov process. Firstly, the computation of probabilities of large deviations of empirical averages from their asymptotic mean; second, the computation of probabilities of crossing a large level for the corresponding additive process. We are motivated by the study of overflows in a buffer whose input is modeled as a Markov fluid.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • D. Anick, D. Mitra, and M. M. Sondhi, “Stochastic theory of a data-handling system with multiple sources, ” Bell Syst. Tech. J. vol. 61, pp. 1871–1894, 1982.

    Google Scholar 

  • P. Baldi, A. Frigessi, and M, Piccioni, “Importance sampling for Gibbs random fields, ” Ann. Appl. Prob. vol. 3, pp. 914–933, 1993.

    Google Scholar 

  • P. Baldi and M. Piccioni, “A representation formula for the rate function of the large deviations principle of the empirical law of a continuous time Markov chain, ” Statist. Probab. Letters vol. 41, pp. 107–115,1999.

    Google Scholar 

  • J. M. Borwein and A. S. Lewis, “Partially-finite programming in L1 and the existence of maximum entropy estimates, ” SIAM Jour. Opt. vol. 3, pp. 248–267, 1992.

    Google Scholar 

  • J. A. Bucklew, “Large Deviation Techniques in Decision, Simulation and Estimation, ” Wiley, New York, 1990.

    Google Scholar 

  • J. A. Bucklew, P. Ney and J. S. Sadowsky, “Monte Carlo simulation and large deviation theory for uniformly recurrent Markov chains, ” J. Appl. Prob. vol. 27, pp. 44–59, 1990.

    Google Scholar 

  • C. S. Chang, P. Heidelberger, S. Jueja, and P. Shahabuddin, “Effective bandwidth and fast simulation of ATM intree networks, ” Perform. Eval. vol. 20, pp. 45–65, 1994.

    Google Scholar 

  • A. Dembo and O. Zeitouni, Large Deviation Techniques and Applications, Jones and Francis: Boston, 1993.

    Google Scholar 

  • G. De Veciana, C. Olivier, and J. Walrand, “Large deviation of birth death Markov fluids, ” Prob. Eng. Inf. Scien. vol. 7, pp. 237–255, 1993.

    Google Scholar 

  • M. D. Donsker and S. R. S. Varadhan, “Asymptotic evaluation of certain Markov process expectations for large time, I, ” Comm. Pure Appl. Math. vol. 28, pp. 1–47, 1975.

    Google Scholar 

  • N. G. Duffield, “Exponential bounds for queues with Markovian arrivals, ” Queueing Systems vol. 17, pp. 413–430, 1994.

    Google Scholar 

  • N. G. Duffield and N. O'Connell, “Large deviations and overflow probabilities for the general single server queue, with applications, ” Math. Proc. Camb. Phil. Soc. vol. 118, pp. 363–374, 1995.

    Google Scholar 

  • R. S. Ellis, “Entropy, Large Deviations and Statistical Mechanics, ” Springer-Verlag: New York, 1985.

    Google Scholar 

  • P. W. Glynn and W. Whitt, “Logarithmic asymptotics for steady state tail probabilities in a single server queue, ” J. Appl. Prob. vol. 31A, pp. 131–159, 1994.

    Google Scholar 

  • G. Kesidis and J. Walrand, “Quick simulation of buffers with on-off multiclass Markov fluid sources, ” ACM. Trans. Mod. Simul. vol. 3, pp. 269–276, 1993a.

    Google Scholar 

  • G. Kesidis and J. Walrand, “Relative entropy between Markov transition rates matrices, ” IEEE Trans. IT vol. 39, pp. 1056–1057, 1993b.

    Google Scholar 

  • G. Kesidis, J. Walrand, and C. S. Chang, “Effective bandwidth for multiclass Markov fluids and other ATM sources, ” IEEE/ACM Trans. Networking vol. 1, pp. 424–428, 1993.

    Google Scholar 

  • P. Lancaster and M. Tismetensky, “The Theory of Matrices, ” Academic Press: Boston, 1986.

    Google Scholar 

  • T. Lehtonen and H. Nyrhinen, “Simulating level crossing probabilities by importance sampling, ” Adv. Appl. Prob. vol. 24, pp. 858–874, 1992a.

    Google Scholar 

  • T. Lehtonen and H. Nyrhinen, “On asymptotically efficient simulation of ruin probabilities in a markovian environment, ” Scand. Actuar. J. pp. 60–75, 1992b.

  • R. M. Loynes, “The stability of a queue with non-independent arrivals and service times, ” Proc. Camb. Phil. Soc. vol. 58, pp. 497–520, 1962.

    Google Scholar 

  • M. Mandjes and A. Ridder, “Finding the conjugate of a Markov fluid processes, ” Prob. Eng. Inf. Scien. vol. 9, pp. 297–315, 1995.

    Google Scholar 

  • A. Ritter and J. Walrand, “Some large deviations results in Markov fluid models, ” Prob. Eng. Inf. Scien. vol. 6, pp. 543–560, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldi, P., Piccioni, M. Importance Sampling for Continuous Time Markov Chains and Applications to Fluid Models*. Methodology and Computing in Applied Probability 1, 375–390 (1999). https://doi.org/10.1023/A:1010050800089

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010050800089

Navigation