Shortest path routing algorithmusing Hopfield neural network
Authors:
- 13 September 2001
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 37 (19) , 1176-1178
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- A neural network based multi-destination routing algorithm for communication network2002
- Neural networks for shortest path computation and routing in computer networksIEEE Transactions on Neural Networks, 1993
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985