Recursive Algorithm for Traffic Distribution Calculation for Certain Unreliable Telephone Exchanges

摘要

One often wishes to calculate the probability function of the number of available trunks for service in a full-availability, blocking telephone exchange, with unreliable trunks. A recursive algorithm for calculating this function is presented. It takes about 1/40 computation time (when the exchange has 50 trunks) than does the brute force method of calculation.