論文

査読有り
2016年11月27日

A Solution Strategy for Packet Routing Problem by Chaotic Neurodynamics with Degree Information

IEICE Proceeding Series
  • Morita Yuuki
  • ,
  • Kimura Takayuki
  • ,
  • Jin'no Kenya

48
開始ページ
A4L-E-6
終了ページ
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.34385/proc.48.A4L-E-6
出版者・発行元
The Institute of Electronics, Information and Communication Engineers

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.

リンク情報
DOI
https://doi.org/10.34385/proc.48.A4L-E-6
CiNii Research
https://cir.nii.ac.jp/crid/1390564227315466496?lang=ja
ID情報
  • DOI : 10.34385/proc.48.A4L-E-6
  • eISSN : 2188-5079
  • CiNii Articles ID : 230000009209
  • CiNii Research ID : 1390564227315466496
  • ORCIDのPut Code : 81506415

エクスポート
BibTeX RIS