Efficient Calculation of Rare Event Probabilities in Markovian Queueing Networks
The authors address the computation of rare event probabilities in Markovian queueing networks with huge or possibly even infinite state spaces. For this purpose, they incorporate ideas from importance sampling simulations into a non-simulative numerical method that approximates transient probabilities based on a dynamical truncation of the state space. A change of measure technique is applied in order to accomplish a guided state space exploration. Numerical results for three different example networks demonstrate the efficiency and accuracy of their method.