Two-link approximation schemes for linear loss networks without controls. (English) Zbl 0920.60075
J. Korean Math. Soc. 35, No. 3, 539-557 (1998); errata ibid. 35, No. 4, 1061-1063 (1998).
The Erlang fixed point (EFP) is a technique used to find close approximations for the blocking probabilities in certain telecommunications networks. In this paper the EFP is compared with a number of other, more complex fixed point techniques in networks, such as ring networks, in which there is significant correlation between neighboring links. Although there is nothing particularly original in this paper it is still worth reading for those interested in fixed point techniques used for the performance analysis of telecommunications networks.
Reviewer: W.Henderson (Adelaide)
MSC:
60K30 | Applications of queueing theory (congestion, allocation, storage, traffic, etc.) |
60K35 | Interacting random processes; statistical mechanics type models; percolation theory |
90B18 | Communication networks in operations research |