Performance analysis of alternate routing with trunk reservation in multirate switched networks

We investigate the performance of dynamic alternate routing with trunk reservation for multirate switched networks. As the considered system shows the property of irreversible Markov chain, it is almost impossible to calculate the exact solutions for a network of practical size due to the calculation complexity. Therefore we slightly modify the conventional Kaufman´s recursive method that has been applied for the reversible Markov chain system. The complexity of the modified approximation is the same as the Kaufman´s method, i.e., O(KC). We compare the approximation results with the analytical results for a small capacity network of C=50. They show very quite similar results. For a large capacity network of C=750, it is almost impossible to calculate the exact solutions due to the computational complexity. Therefore we compare the approximation results with the simulation results. We simulate a network of seven nodes. If we consider errors due to the reduced load effect for the approximation, we can conclude that the approximate results are quite accurate. These results can be used to design a B-ISDN network that improves network throughput by using alternate routes. As alternate routing with trunk reservation has been widely used for single rate switched networks, we can expect that it can be easily applied for multirate switched networks. In that case our results can be used to obtain optimal trunk reservation parameters