A Fixed-Point Algorithm for Closed Queueing Networks

In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and accurate in case of large numbers of nodes and large customer populations. We present the method, put it in perspective, and validate it through a large number of test scenarios. In most cases, the method provides accuracies within 5% relative error (in comparison to discrete-event simulation).

• Type: Conference
• Year: 2007
• Where: EPEW
• Authors: Ramin Sadre, Boudewijn R. Haverkort, Patrick Reinelt
• Keywords: Closed Queueing Networks, EPEW 2007, Efficient Iterative Scheme, Large Number