Product form approximations for highly linear loss networks with trunk reservation

  • Authors:

  • M. Bebbington;P. Pollett;I. Ziedins

  • Affiliations:

  • Institute of Information Sciences and Technology Massey University, New Zealand;Department of Mathematics The University of Queensland Brisbane, Australia;Department of Statistics The University of Auckland Auckland, New Zealand

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.98

Visualization

Abstract

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation.