ANALYSIS OF NEURAL-NETWORK ROUTING SCHEME FOR TELECOMMUNICATION NETWORK

In this paper, a description of the Hopfield/Tank model used for the t elecommunication network routing problem is given at first. And then t hrough the ''static'' (i.e. the eigenvalue and the eigenspace of the c onnection matrix) and the dynamic analysis of the model, it has been f ound that the model has the faster rate to converge to the optimal or sub-optimal solutions from an initial value. Therefore the quality of the final solutions can be guaranteed. The influence of the initial va lue to the final solutions is also concerned in this paper. The simula tion results are given at the end of this paper.