We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...