Linear stochastic fluid networks: rare-event simulation and Markov modulation

O.J. Boxma, E.J. Cahen, D. Koops, M. Mandjes (Corresponding author)

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
46 Downloads (Pure)

Abstract

We consider a linear stochastic fluid network under Markov modulation, with a focus on the probability that the joint storage level attains a value in a rare set at a given point in time. The main objective is to develop efficient importance sampling algorithms with provable performance guarantees. For linear stochastic fluid networks without modulation, we prove that the number of runs needed (so as to obtain an estimate with a given precision) increases polynomially (whereas the probability under consideration decays essentially exponentially); for networks operating in the slow modulation regime, our algorithm is asymptotically efficient. Our techniques are in the tradition of the rare-event simulation procedures that were developed for the sample-mean of i.i.d. one-dimensional light-tailed random variables, and intensively use the idea of exponential twisting. In passing, we also point out how to set up a recursion to evaluate the (transient and stationary) moments of the joint storage level in Markov-modulated linear stochastic fluid networks.

Original languageEnglish
Pages (from-to)125-153
Number of pages29
JournalMethodology and Computing in Applied Probability
Volume21
Issue number1
DOIs
Publication statusPublished - 1 Mar 2019

Keywords

  • Importance sampling
  • Linear networks
  • Queues
  • Rare events
  • Stochastic processes

Fingerprint

Dive into the research topics of 'Linear stochastic fluid networks: rare-event simulation and Markov modulation'. Together they form a unique fingerprint.

Cite this