Giuliano Casale, Peter G. Harrison, Maria Vigliotti
We introduce a product-form approximation for tandem networks with Poisson arrivals and non-exponential service times. The proposed technique perturbs the model state space to match the sufficient conditions for product-form solution provided by the Reversed Compound Agent Theorem (RCAT). After characterizing the relationship between RCAT productforms and matrix geometric solutions, we develop an algorithm based on nonlinear programming that automatically searches for an approximating product-form model.
Information from pubs.doc.ic.ac.uk/tandem-queue-approx.