A Packet Routing Method Using Chaotic Neurodynamics for Complex Networks

Kimura, Takayuki; Ikeguchi, Tohru

doi:10.1007/11840930_105

Cited by 4 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further, by memory information realized by the refractory effect of the chaotic neuron, the improved chaotic routing strategy may show higher performance than the Echenique routing strategy [1], [29] by introducing the waiting-time information at adjacent nodes. From above view points, we improved the previous chaotic routing strategy [13]- [18] by introducing their information [19]. Then, we confirmed that the improved chaotic routing strategy has high performance for the complex networks such as small-world networks [30] and the scale-free networks [31].…”

Section: Introductionsupporting

confidence: 74%

“…Using these information, the routing strategy [1], [29] shows high performance for the communication network. Then, we expect that the performance of the chaotic routing strategy [13]- [18] is also enhanced, if the node obtains not only the shortest distance information but also the waiting-time information at adjacent nodes. Further, by memory information realized by the refractory effect of the chaotic neuron, the improved chaotic routing strategy may show higher performance than the Echenique routing strategy [1], [29] by introducing the waiting-time information at adjacent nodes.…”

Section: Introductionmentioning

confidence: 98%

“…From this view point, we have already proposed a routing strategy with chaotic neurodynamics [13], [14], [15], [16], [17], [18], [19].…”

Section: Introductionmentioning

confidence: 98%

“…Using the refractory effect or the past routing history, the chaotic routing strategy shows high performance for several types of Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 31 -August 5, 2011 978-1-4244-9637-2/11/$26.00 ©2011 IEEE complex network topologies such as the small-world network and the scale-free network [13]- [18].…”

Section: Introductionmentioning

confidence: 99%

“…In this chaotic routing strategy [13]- [19], a refractory effect, which is an important characteristic in nerve membrane [28] and produces the chaotic neurodynamics plays a key role: it memorizes a past routing history. Using the refractory effect or the past routing history, the chaotic routing strategy shows high performance for several types of Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 31 -August 5, 2011 978-1-4244-9637-2/11/$26.00 ©2011 IEEE complex network topologies such as the small-world network and the scale-free network [13]- [18].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Chaotic routing strategy with load-balanced effects for communication networks

Kimura

Ikeguchi

2011

The 2011 International Joint Conference on Neural Networks

Self Cite

View full text Add to dashboard Cite

To establish reliable communicate between end users, alleviation of the congestion of packets in the communication networks is the most important problem. Many approaches have been attempting to resolve such a problem. As one of the effective routing strategies for reliable communication, we have also proposed a routing strategy with chaotic neurodynamics. By a refractory effect which is the most important effect of chaotic neuron, the routing strategy shows high performance for communication networks as compared to the shortest path approach. In addition, we improved the routing strategy by combining information of the shortest paths and waiting times at adjacent nodes. As a result, we confirmed that the routing strategy using chaotic neurodynamics is the most effective policy to alleviate the congestion of the packets in the communication network. However, in the previous works, the chaotic routing strategy was evaluated for ideal communication networks; each node has same transmission capability for routing the packets and same size of buffer for storing the packets. From a view point of realistic application of the chaotic routing strategy, it is important to evaluate the performance of the routing strategy under realistic conditions. In 2007, M.Hu et al. proposed a realistic communication network in which the largest storage capacity and processing capability are introduced [5]. Thus, in this paper, we evaluate the chaotic routing strategy for the realistic communication networks [5]. Results show that the chaotic routing strategy keeps the highest arrival rate of the packets as compared to the conventional routing strategies by avoiding the congestion of the packets effectively. Also, we confirmed that the chaotic routing strategy has much possibility for application in the real communication networks.

show abstract