Abstract :
The paper describes a method for generating artificial traffic based on Kosten´s traffic model and some statistical properties of artificial traffic. The method is applied to the simulation of a 10 000-line t.d.m. exchange and to the problem of hunting through two space switches in series, each with limited availability. Results are given for both these problems. Although the method as described is restricted to the case of equal traffic from all subscribers or sources, the extension to the general case is quite straightforward. The medium-speed Stantec-Zebra computer proved to be quite adequate for the work.
