Routing in computer networks using artificial neural networks

This paper proposes a heuristic approach based on Hopfield model of neural networks to solve the problem of routing which constitutes one of the key a spects of the topological design of computer networks. Adaptive to changes in link costs and network topology, the proposed approach relies on the uti lization of an energy function which simulates the objective function used in network optimization while respecting the constraints imposed by the net work designers. This function must converge toward a solution which, if not the best is at least as close as possible to the optimum. The simulation r esults reveal that the end-to-end delay computed according to this neural n etwork approach is usually better than those determined by the conventional routing heuristics, in the sense that our routing algorithm realizes a bet ter trade-off between end-to-end delay and running time, and consequently g ives a better performance than many other well-known optimal algorithms. (C ) 2000 Elsevier Science Ltd. All rights reserved.