Summary
2007 International Symposium on Nonlinear Theory and its Applications
2007
Session Number:17PM1-C
Session:
Number:17PM1-C-2
An e?cient routing strategy with load-balancing for complex networks
Takayuki Kimura, Tohru Ikeguchi,
pp.31-34
Publication Date:2007/9/16
Online ISSN:2188-5079
DOI:10.34385/proc.41.17PM1-C-2
Summary:
Congestion of packets in the Internet is the most undesirable problem to securely communicate between end users. Thus, many approaches have been attempting to resolve such a problem. We have also proposed a routing strategy with chaotic neurodynamics[1]. The chaotic neurodynamics is introduced to alleviate the packet congestion, then, the routing strategy shows high performance for complex networks comparing with the shortest path approach (the Dijkstra algorithm). In the routing strategy, an adjacent node from which a path to a destination of a packet is the shortest is determined as a transmitting node. However, if we obtain more information, we expect that the performance of the routing strategy becomes higher. From this view point, in this paper, we extend the routing strategy, combining information of the shortest path and waiting times at adjacent nodes. We show that the improved routing strategy has high performance for the complex networks.