Optimization for packet routing using chaotic neurodynamics

• KIMURA Takayuki

  Graduate school of Science and Engineering, Saitama University

• IKEGUCHI Tohru

  Graduate school of Science and Engineering, Saitama University

Bibliographic Information

Other Title

• カオスニューロダイナミクスを用いたパケットルーティングの最適化

Abstract

We propose a new packet routing method using chaotic neurodynamics. We first compose a basic packet routing method with a neural network which uses information of shortest path lengths from a node to the other nodes. When the network topology is regular, the routing method works well, however, when the network topology becomes irregular, the routing method doesn't work well. The reason is that almost all packets cannot be sent to their destinations because of congestions of packets in the computer network. To avoid such an undesirable problem, we extended this method to employ chaotic neurodynamics. We confirm that our proposed method is very effective for randomized networks and scale-free networks comparing with the Dijkstra algorithm.

Journal

• IEICE Technical Report

  IEICE Technical Report 105 (548), 43-48, 2006-01-18

  The Institute of Electronics, Information and Communication Engineers

Keywords

• Chaotic Neural Network
• Packet routing
• Decentralized control

Details

• CRID: 1570572702035347968
• NII Article ID: 110004083220
• NII Book ID: AN10060800
• Text Lang: ja
• Data Source:
  • CiNii Articles