Destruction-Resistant Routing Protocol Based on Topology Prediction and Backup Path

Zhe Li, Xupeng Li
{"title":"Destruction-Resistant Routing Protocol Based on Topology Prediction and Backup Path","authors":"Zhe Li, Xupeng Li","doi":"10.1109/ICMCT57031.2022.00016","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of poor adaptability of traditional OSPF routing protocol in high dynamic space-based information network, this paper proposes I-OSPF routing protocol based on topology prediction and backup path, adopts variable cycle topology discovery mechanism, dynamically adjusts OSPF topology discovery cycle by predicting the time of network topology change, and reduces the topology discovery cycle when the topology is about to change. Meanwhile, topology maintenance nodes are selected to broadcast link information, replacing the mechanism of all nodes forwarding link information, which effectively reduces the flood load. In addition, two transmission paths from the source node to the destination node are constructed to evenly distribute the network traffic and ensure the invulnerability of the network. In this paper, the simulation scenario of space-based information network is established, and the simulation test of the proposed routing protocol is carried out. The results show that the I-OSPF routing protocol has an obvious effect on improving the network survivability, greatly reduces the fault perception time, and improves the discovery efficiency of rerouting.","PeriodicalId":447227,"journal":{"name":"2022 7th International Conference on Multimedia Communication Technologies (ICMCT)","volume":"108 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Multimedia Communication Technologies (ICMCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCT57031.2022.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the problem of poor adaptability of traditional OSPF routing protocol in high dynamic space-based information network, this paper proposes I-OSPF routing protocol based on topology prediction and backup path, adopts variable cycle topology discovery mechanism, dynamically adjusts OSPF topology discovery cycle by predicting the time of network topology change, and reduces the topology discovery cycle when the topology is about to change. Meanwhile, topology maintenance nodes are selected to broadcast link information, replacing the mechanism of all nodes forwarding link information, which effectively reduces the flood load. In addition, two transmission paths from the source node to the destination node are constructed to evenly distribute the network traffic and ensure the invulnerability of the network. In this paper, the simulation scenario of space-based information network is established, and the simulation test of the proposed routing protocol is carried out. The results show that the I-OSPF routing protocol has an obvious effect on improving the network survivability, greatly reduces the fault perception time, and improves the discovery efficiency of rerouting.
基于拓扑预测和备份路径的抗破坏路由协议
针对传统OSPF路由协议在高动态天基信息网络中适应性差的问题,提出了基于拓扑预测和备份路径的I-OSPF路由协议,采用变周期拓扑发现机制,通过预测网络拓扑变化的时间动态调整OSPF拓扑发现周期,缩短拓扑即将变化时的拓扑发现周期。同时,选择拓扑维护节点广播链路信息,取代了所有节点转发链路信息的机制,有效降低了洪水负荷。另外,从源节点到目的节点构建了两条传输路径,使网络流量均匀分布,保证网络的不受攻击。本文建立了天基信息网络的仿真场景,对所提出的路由协议进行了仿真测试。结果表明,I-OSPF路由协议对提高网络生存性有明显的效果,大大缩短了故障感知时间,提高了重路由的发现效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信