Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks

A method inspired from S. Katz´s service evaluation algorithm [6] is presented. The new algorithm is recursive, rather than iterative, in nature, and especially suited for networks that do not contain cycles. It also introduces two new features which take existing theoretical results into account, and as such corresponds more closely to the current state of traffic theory.