A fixed-point approximation accounting for link interactions in a loss network

Thompson, M.R. and Pollett, P.K.

[Full Text]

Abstract: This paper is concerned with evaluating the performance of loss networks. We develop a reduced load approximation that improves on the famous Erlang fixed point approximation (EFPA) in a variety of circumstances. We illustrate our results with reference to a line network for which the EFPA may be expected to perform badly.

Keywords: Blocking probabilities, Erlang Fixed Point

Acknowledgement: This worked was funded by the Australian Research Council.

The authors:

• Mark Thompson, Discipline of Mathematics, The University of Queensland. M.Thompson@qic.com.au
• Phil Pollett, Discipline of Mathematics, The University of Queensland. pkp@maths.uq.edu.au

Back to Research Communications

Back to PKP's home page

Last modified: 14th November 2001