An approximate model of a switching network carrying mixture of different multichannel traffic streams

Abstract

An approximate model of a multistage switching network carrying a mixture of different multichannel traffic streams is proposed. In the model the multistage switching network is reduced to a single-channel system, that is, to an Erlang ideal grading to which a mixture of different multichannel traffic is offered. An approximate method for recurrence determination of the distribution of being busy in such grading is presented. The determined distribution enables calculation of blocking probabilities for traffic streams of various classes. The derived formula is a generalization of Kaufman (1981) and Robert's (1981) recurrence formula covering a full-availability trunk group with various multichannel traffic streams, and it can be useful for the analysis of ISDN systems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>