A reduced load approximation accounting for link interactions in a loss network
type: Item
instance of: scholarly article
title: A reduced load approximation accounting for link interactions in a loss network
zbMATH Open document ID: 1070.90019
DOI: 10.1155/S1173912603000191
author: M. R. Thompson
author: P. K. Pollett
published in: Journal of Applied Mathematics and Decision Sciences
publication date: 2005-04-05T00:00:00Z
full work available at URL: https://eudml.org/doc/125073
review text: The paper is concerned with evaluating the performance of loss networks. Accurate determination of loss network performance can assist in the design and dimensioning of telecommunications networks. However, exact determination can be difficult and generally cannot be done in reasonable time. For these reasons there is much interest in developing fast and accurate approximations. The authors develop a reduced load approximation that improves on the famous Erlang fixed point approximation (EFPA) in a variety of circumstances. They illustrate their results with reference to a range of networks for which the EFPA may be expected to perform badly.
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 2152451
zbMATH Keywords: loss networks
zbMATH Keywords: blocking probabilities
zbMATH Keywords: Erlang fixed point
reviewed by: Jacek Blazewicz
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2152451