Summary
2011 International Symposium on Nonlinear Theory and Its Applications
2011
Session Number:A1L-C
Session:
Number:A1L-C2
A Chaotic Routing Strategy for Packet Delivery in Complex Networks
Takayuki Kimura, Tohru Ikeguchi,
pp.44-47
Publication Date:2011/9/4
Online ISSN:2188-5079
Summary:
To establish reliable communicate between end users, alleviation of the congestion of packets in the communication networks is the most important problem. As one of the effective routing strategies for reliable communication, we have 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. Recently, Newman et al. proposed scale-free networkswith community structures[1] which effectively extracts communities in the realistic complex networks using the shortest path betweenness. The networks[1] have the common structure in the real complex networks such as collaboration networks or the communication networks. Then, to clarify the performance of the chaotic routing strategy for the realistic communication networks, we evaluate the chaotic routing strategy for the scale-free networks with community structure in this paper. 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.