On blocking probability equalisation in switching networks with rearrangement and reservation mechanisms

In the paper methods for increasing the traffic load capacity of switching networks servicing integrated traffic have been considered, i.e. the bandwidth reservation mechanism and rearrangement mechanism. Methods for calculating the upper and lower bound of blocking probability in TST (time space time) networks have been presented, which correspond to the minimum and maximum traffic capacity of the network. Calculation results have been compared with simulation data.