Asymptotic behavior of the expansion method for open finite queueing networks
Résumé
In previous papers, we have reported on the use of the expansion method for estimating sojourn times in finite network topologies. In this paper, we focus on comparing the expansion method with P. C. Bell's consistency conditions where subject to unbalanced service rates at tandem queues, other decomposition approaches yield impossible throughput results. We compare numerical results of the expansion method with the other approaches in light of these conditions.