A neural network for shortest path computation

This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns successful and valid convergence. Experimental results show that an improvement in successful convergence can be achieved in certain classes of graphs. Additionally, computation performance is also improved at the expense of slightly worse results.

[1]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[2]  H.E. Rauch,et al.  Neural networks for routing communication traffic , 1988, IEEE Control Systems Magazine.

[3]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[4]  S.C.A. Thomopoulos,et al.  Neural network implementation of the shortest path algorithm for traffic routing in communication networks , 1989, International 1989 Joint Conference on Neural Networks.

[5]  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).

[6]  Mischa Schwartz,et al.  Telecommunication networks , 1987 .

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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