Communication in the computer networks with chaotic neurodynamcis

Takayuki Kimura, Tohru Ikeguchi

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)


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 already proposed a routing strategy with chaotic neurodynamics. The chaotic neurodynamics is introduced to alleviate the packet congestion, then, the routing strategy shows higher performance for complex networks than the shortest path approach (the Dijkstra algorithm). In this paper, we extend the routing strategy by combining waiting time at adjacent nodes. We show that the improved routing strategy has high performance for the scale-free networks.

Original languageEnglish
Title of host publicationApplications of Nonlinear Dynamics
Subtitle of host publicationModel and Design of Complex Systems
Number of pages4
Publication statusPublished - 27 Mar 2009

Publication series

NameUnderstanding Complex Systems
ISSN (Print)1860-0832
ISSN (Electronic)1860-0840


Cite this

Kimura, T., & Ikeguchi, T. (2009). Communication in the computer networks with chaotic neurodynamcis. In Applications of Nonlinear Dynamics: Model and Design of Complex Systems (pp. 417-420). (Understanding Complex Systems; Vol. 2009).