Dynamic alternative routing performance improvement

One of the most important measures of service quality of a circuit-switched network is the end-to-end blocking of each node pair. In order to reduce the end-to-end blocking of each node pair and to increase incoming traffic of circuit-switched network, a few countries developed dynamic routing strategies. This paper analyses the difference between the classical algorithm and the improved algorithm and presents an approximate algorithm of this improved algorithm for simulation through programming. This paper lists the result to prove that this improved algorithm is feasible and efficient.