Packet congestion is the one of most undesirable problems in the Internet in order to realize securely communication between end users. Thus, many approaches have been attempting to resolve such a problem. We have also proposed a routing strategy with chaotic neurodynamics. By a refractory effect which is the most important effect of the chaotic neuron, the routing strategy shows higher performance for various topologies of computer networks than the shortest path approach, In the routing strategy, an adjacent node which has the shortest distance to a destination of a packet is determined as a transmitting node of a packet. However, we expect that the performance of the routing strategy is enhanced if additional information is introduced. From this view point, in this report, we improve the routing strategy, combining information of the shortest path and waiting times at adjacent nodes. From the results of the computer simulation, we confirmed that the improved chaotic routing strategy shows higher performance than the conventional chaotic routing strategy or another routing strategy. Furthermore, we analyze the effectiveness of the routing strategy to apply the method of surrogate data to time-series of internal states which produce the chaotic neurodynamics. As a result, we confirm that even if the improved chaotic routing strategy is modified by introducing the waiting-time information at adjacent nodes, the chaotic neurodynamics is the most effective to alleviate the packet congestion in the computer network.
展开▼
