**A. Angius, A. Horváth, and V. Wolf**

In this paper we deal with transient analysis of
networks of queues. These systems most often have enormous
state space and the exact computation of their transient behavior
is not possible. We propose an approximate technique based on
assumptions on the structure of the transient probabilities. In
particular, we assume that the transient probabilities of the model
can be decomposed into a quasi product form. This assumption
simplifies the dependency structure of the model and leads to
a relatively small set of ordinary differential equations (ODE)
that can be used to compute an approximation of the transient
probabilities. We provide the derivation of this set of ODEs and
illustrate the accuracy of the approach on several numerical
examples.

horvath 2014-09-17