The traffic performance of time-space-time (TST) switching networks built from large time-switching stages used in digital switching systems is discussed. These switching networks exhibit steep load-service characteristics and present new numerical problems for traffic performance evaluation. The precise numerical calculation of switch blocking and the amount of search effort needed to find a network path are addressed. Computational efficiency and robustness are emphasized. The approach is based on a familiar model that uses state-dependent transitions in formulating the balance equations. A comparative study with traditional methods illustrates the numerical gains to be made for switching networks of arbitrary size. >
['D Manfield', 'Maged E. Beshai']
Traffic analysis of large TST networks