| Article ID: | iaor1999697 |
| Country: | Japan |
| Volume: | 80 |
| Issue: | 8 |
| Start Page Number: | 1 |
| End Page Number: | 6 |
| Publication Date: | Aug 1997 |
| Journal: | Electronics and Communications in Japan, Part I Communications |
| Authors: | Kawahigashi H., Tanaka K., Oshima K. |
| Keywords: | neural networks, networks: path |
Recently, application of neural networks using their parallel processing feature has progressed. This paper proposes a routing method using a neural network and based on dynamic programming. The proposed method finds the least-hop path between two points in a communication network. The method consists of the application of disturbance to the destination, propagation of the disturbance to the source, and search for the shortest path from the source to the destination, using the distribution of the influences of the disturbance at each node.