Optimal Routing in Packet Switching Network by using Neural Network

The routing in packet switching network is considered as a shortest-path (SP) problem. The new routing algorithm, initially inspired by the Hopfield neural network, is designed to find the optimal link between source and destination node taking into account not only the shortest path but also several in-node constraints, including link bandwidth, incoming flow and flow statistics, addressed to avoiding the packet loss. The applicability of the proposed algorithm is demonstrated through computer simulations for different network architectures and traffic conditions.