Neural networks for shortest path computation and routing in computer networks
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 4 (6), 941-954
- https://doi.org/10.1109/72.286889
Abstract
The application of neural networks to the optimum routing problem in packet-switched computer networks, where the goal is to minimize the network-wide average time delay, is addressed. Under appropriate assumptions, the optimum routing algorithm relies heavily on shortest path computations that have to be carried out in real time. For this purpose an efficient neural network shortest path algorithm that is an improved version of previously suggested Hopfield models is proposed. The general principles involved in the design of the proposed neural network are discussed in detail. Its computational power is demonstrated through computer simulations. One of the main features of the proposed model is that it will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology.Keywords
This publication has 15 references indexed in Scilit:
- Neural networks for routing communication trafficIEEE Control Systems Magazine, 1988
- On the stability of the Travelling Salesman Problem algorithm of Hopfield and TankBiological Cybernetics, 1988
- Neural networks for computation: number representations and programming complexityApplied Optics, 1986
- Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuitIEEE Transactions on Circuits and Systems, 1986
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Neurons with graded response have collective computational properties like those of two-state neurons.Proceedings of the National Academy of Sciences, 1984
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- The Gradient Projection Algorithm for Multiple Routing in Message-Switched NetworksIEEE Transactions on Communications, 1976
- Optimal Routing in a Packet-Switched Computer NetworkIEEE Transactions on Computers, 1974
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973