Shortest path routing algorithm using Hopfield neural network

A near-optimal routing algorithm employing a modified Hopfield neural network (HNN) is presented. Since it uses every piece of information that is available at the peripheral neurons, in addition to the highly correlated information that is available at the local neuron, faster convergence and better route optimality is achieved than with existing algorithms that employ the HNN. Furthermore, all the results are relatively independent of network topology for almost all source-destination pairs.

[1]  Dong-Chul Park,et al.  A neural network based multi-destination routing algorithm for communication network , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[2]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.