We have discussed an extension of the Erlang loss formula to an ATM network with a finite number of connection types with different capacity demands and with a general connection acceptance procedure. When we limit the treatment to cases where the connection acceptance function is a linear function of the number of connections of the different connection types, fast algorithms exist for calculating the connection blocking probabilities. Thus, dimensioning of trunk groups based on objectives for the connection blocking probabilities, can be achieved rather straightforward in these cases. Linear connection acceptance functions will be dominating in early ATM networks.
展开▼
