Modeling and Simulation of Network-on-Chip Routing Algorithm Based on OPNET

Fei Li, Wanjia Gao, Liangchang Chen, Wenyi Liu
{"title":"Modeling and Simulation of Network-on-Chip Routing Algorithm Based on OPNET","authors":"Fei Li, Wanjia Gao, Liangchang Chen, Wenyi Liu","doi":"10.1109/ICHCI51889.2020.00075","DOIUrl":null,"url":null,"abstract":"When a large amount of data floods into the network, the traditional routing algorithm of the Network-onChip will cause network congestion due to the selection of the same path, which will seriously affect the transmission and realtime performance of the data. Based on that, this paper proposes an efficient adaptive routing algorithm to avoid the situation. In this paper, the binary tree topology was improved. Then this paper uses OPNET simulation software to model the improved routing algorithm in three layers, and performs simulation experiments on the model. The evaluations show that the simulation results of the algorithm meet the expectations, and the algorithm can select the shortest path for the packets flooding into the network, which avoiding network congestion. The endto-end delay is 48s less than the traditional routing algorithm, and the real-time performance is higher. This research can effectively avoid network congestion when there is a mass of data in the network.","PeriodicalId":355427,"journal":{"name":"2020 International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICHCI51889.2020.00075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When a large amount of data floods into the network, the traditional routing algorithm of the Network-onChip will cause network congestion due to the selection of the same path, which will seriously affect the transmission and realtime performance of the data. Based on that, this paper proposes an efficient adaptive routing algorithm to avoid the situation. In this paper, the binary tree topology was improved. Then this paper uses OPNET simulation software to model the improved routing algorithm in three layers, and performs simulation experiments on the model. The evaluations show that the simulation results of the algorithm meet the expectations, and the algorithm can select the shortest path for the packets flooding into the network, which avoiding network congestion. The endto-end delay is 48s less than the traditional routing algorithm, and the real-time performance is higher. This research can effectively avoid network congestion when there is a mass of data in the network.
基于OPNET的片上网络路由算法建模与仿真
当大量数据涌入网络时,传统的网片路由算法由于选择相同的路径,会造成网络拥塞,严重影响数据的传输和实时性能。在此基础上,本文提出了一种有效的自适应路由算法来避免这种情况。本文对二叉树拓扑进行了改进。然后利用OPNET仿真软件对改进的路由算法进行三层建模,并对模型进行仿真实验。实验结果表明,该算法的仿真结果符合预期,能够为涌入网络的数据包选择最短路径,避免了网络拥塞。该算法的端到端时延比传统路由算法小48秒,实时性更高。该研究可以有效地避免网络中存在大量数据时的网络拥塞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信