A Solution Strategy for Packet Routing Problem by Chaotic Neurodynamics with Degree Information
-
- Yuuki Morita
- Nippon Institute of Technology
-
- Takayuki Kimura
- Nippon Institute of Technology
-
- Kenya Jin'no
- Nippon Institute of Technology
抄録
Recently, because of the rapid spread of mobile devices, the number of flowing packets in the computer network increases and this causes the congestion of the packets. As one of the effective packet routing methods to remove the packet congestion, a packet routing method using chaotic neurodynamics has already been proposed. By using the chaotic neurodynamics that realizes the decentralized routings of the packets, this method shows higher arrival rate of the packets than the shortest path routing. However, if the number of packets drastically increases, the method shows poor performance because the packets are congested at the hub nodes. We then proposed new routing strategy by chaotic neurodynamics with degree information in this paper. From the results of the numerical simulations, the proposed routing method alleviates the packet congestion at the hub nodes effectively, showing that large number of packets are transmitted to their destinations as compared to the conventional chaotic routing method and the shortest path routing.
収録刊行物
-
- IEICE Proceeding Series
-
IEICE Proceeding Series 48 A4L-E-6-, 2016-11-27
The Institute of Electronics, Information and Communication Engineers
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390564227315466496
-
- NII論文ID
- 230000009209
-
- ISSN
- 21885079
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可