Blocking Probability of Noninteger Groups with Trunk Reservation

A model for computing the blocking probability in circuitswitched networks operating with trunk reservation is extended to the case of noninteger trunk numbers. This generalization is required if the model is to be used in network optimization algorithms, which are generally evaluated over the reals. A simple extension is first presented, and shown to be numerically unstable over some values of the parameters. A recursive approach is then explained that is both robust and efficient for an integer number of reserved trunks and arbitrary parameters. The model is finally extended to arbitrary trunk numbers, and an efficient and robust algorithm is proposed.