Chaotic dynamics for avoiding congestion in the computer network

Abstract

We proposed a new algorithm for packet routing problems using chaotic neurodynamics and analyze its statistical behavior. First, we construct a basic neural network which works in the same way as the Dijkstra algorithm that uses information of shortest path lengths from a node to another node in a computer network. When the computer network has a regular topology, the basic routing method works well. However, when the computer network has an irregular topology, it fails to work, because most of packets cannot be transmitted to their destinations due to packet congestion in the computer network. To avoid such an undesirable problem, we extended the basic neural network to employ chaotic neurodynamics. We confirm that our proposed method exhibits good performance for complex networks, such as scale-free networks. © Springer-Verlag Berlin Heidelberg 2006.