On the numerical evaluation of some basic traffic formulae
R. F. Farmer, Ilia Kaufman · Networks · 1978
Abstract The problem of evaluating some basic traffic tormulae is considered here from a computational point of view. The specific problems include the evaluation of Poisson, Erlang B and Erlang C blocking functions and their associated inverses. Formulae related to Wilkinson's nonrandom traffic theory are also included. The methods presented are simple, efficient and accurate. They are based on several newly derived formulae and are ideally suited for extensive computerized network analysis, design and optimization problems. These methods have been incorporated into the simulator of the Canadian network. This simulator is widely used in analyzing the usage of the network as well as in assessing the impact of changing loads which arise from shifts in the economy, demand or rates.