A reduced load approximation accounting for link interactions in a loss network (Q1769998)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A reduced load approximation accounting for link interactions in a loss network |
scientific article; zbMATH DE number 2152451
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reduced load approximation accounting for link interactions in a loss network |
scientific article; zbMATH DE number 2152451 |
Statements
A reduced load approximation accounting for link interactions in a loss network (English)
0 references
5 April 2005
0 references
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.
0 references
loss networks
0 references
blocking probabilities
0 references
Erlang fixed point
0 references