Reliable Routing of Time-Triggered Traffic in Time Sensitive Networks

Q3 Arts and Humanities
Icon Pub Date : 2023-03-01 DOI:10.1109/ICNLP58431.2023.00090
Shaojie Hou, Wujun Yang, Yuanzheng Cheng, Liyuan Feng
{"title":"Reliable Routing of Time-Triggered Traffic in Time Sensitive Networks","authors":"Shaojie Hou, Wujun Yang, Yuanzheng Cheng, Liyuan Feng","doi":"10.1109/ICNLP58431.2023.00090","DOIUrl":null,"url":null,"abstract":"With the continuous evolution of industrial network technology, industrial production has higher and higher requirements for reliability and real-time performance. At present Time Sensitive Networks (TSN) has become one of the evolution directions of the next generation network bearing technology. In TSN, redundancy is usually adopted to meet the reliability requirements of Time-Triggered (TT) flow. However, a large amount of bandwidth consumption caused by redundancy is also inevitable, which will directly affect the schedulability of TT flows. Therefore, this paper proposes a Genetically based Reliable Routing algorithm (GRR) based on Frame Replication and Elimination for Reliability (FRER) standard, which provides reliable and non-overlapping routes for different copies of each TT flow. It not only guarantees the reliability of the TT flow, but also increases its schedulability, so as to meet the needs of industrial applications. Through simulation experiments, compared with the existing methods, the reliability of the proposed reliable routing algorithm is improved by 2.08% on average and the schedulability is improved by 6.3% on average.","PeriodicalId":53637,"journal":{"name":"Icon","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Icon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNLP58431.2023.00090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 0

Abstract

With the continuous evolution of industrial network technology, industrial production has higher and higher requirements for reliability and real-time performance. At present Time Sensitive Networks (TSN) has become one of the evolution directions of the next generation network bearing technology. In TSN, redundancy is usually adopted to meet the reliability requirements of Time-Triggered (TT) flow. However, a large amount of bandwidth consumption caused by redundancy is also inevitable, which will directly affect the schedulability of TT flows. Therefore, this paper proposes a Genetically based Reliable Routing algorithm (GRR) based on Frame Replication and Elimination for Reliability (FRER) standard, which provides reliable and non-overlapping routes for different copies of each TT flow. It not only guarantees the reliability of the TT flow, but also increases its schedulability, so as to meet the needs of industrial applications. Through simulation experiments, compared with the existing methods, the reliability of the proposed reliable routing algorithm is improved by 2.08% on average and the schedulability is improved by 6.3% on average.
时间敏感网络中时间触发流量的可靠路由
随着工业网络技术的不断发展,工业生产对可靠性和实时性的要求越来越高。目前,时间敏感网络(TSN)已成为下一代网络承载技术的发展方向之一。在TSN中,通常采用冗余来满足TT (Time-Triggered flow)流的可靠性要求。但是,由于冗余造成的大量带宽消耗也是不可避免的,这将直接影响TT流的可调度性。因此,本文提出了一种基于帧复制和可靠性消除(frr)标准的遗传可靠路由算法(GRR),该算法为每个TT流的不同副本提供可靠且不重叠的路由。它既保证了TT流程的可靠性,又提高了其可调度性,从而满足工业应用的需求。通过仿真实验,与现有方法相比,所提出的可靠路由算法的可靠性平均提高了2.08%,可调度性平均提高了6.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Icon
Icon Arts and Humanities-History and Philosophy of Science
CiteScore
0.30
自引率
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学术官方微信