Multiple Cascaded Preconfigured Cycles for the FRER Mechanism in Time-Sensitive Networking

Zongchen Yao, Yueping Cai, Tianchi Li
{"title":"Multiple Cascaded Preconfigured Cycles for the FRER Mechanism in Time-Sensitive Networking","authors":"Zongchen Yao, Yueping Cai, Tianchi Li","doi":"10.1109/ICCWorkshops50388.2021.9473726","DOIUrl":null,"url":null,"abstract":"TSN (Time-Sensitive Networking) defines a set of standards that add deterministic low-latency services to Ethernet. High reliability is also one essential feature of TSN. IEEE 802.1CB introduces the FRER (Frame Replication and Elimination for Reliability) mechanism for TSN. It transmits duplicated frames through two disjoint paths and eliminates one copy at the destination node to improve the service reliability. However, it is not always an easy task to find two disjoint paths between the source and destination nodes considering different network topologies and network states. In addition, the FRER mechanism only considers paths with the shortest number of hops without considering the properties of links such as reliability, load, and centrality. This paper proposes a method called Multiple Cascaded Preconfigured Cycles (FRER-MPC) to find two optimized paths for the FRER mechanism in TSN. The FRER-MPC mechanism selects a working path based on the link priority model, and it computes a redundant path through multiple preconfigured cycles. Simulation results show that it effectively improves the path reliability with some extra bandwidth consumptions.","PeriodicalId":127186,"journal":{"name":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWorkshops50388.2021.9473726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

TSN (Time-Sensitive Networking) defines a set of standards that add deterministic low-latency services to Ethernet. High reliability is also one essential feature of TSN. IEEE 802.1CB introduces the FRER (Frame Replication and Elimination for Reliability) mechanism for TSN. It transmits duplicated frames through two disjoint paths and eliminates one copy at the destination node to improve the service reliability. However, it is not always an easy task to find two disjoint paths between the source and destination nodes considering different network topologies and network states. In addition, the FRER mechanism only considers paths with the shortest number of hops without considering the properties of links such as reliability, load, and centrality. This paper proposes a method called Multiple Cascaded Preconfigured Cycles (FRER-MPC) to find two optimized paths for the FRER mechanism in TSN. The FRER-MPC mechanism selects a working path based on the link priority model, and it computes a redundant path through multiple preconfigured cycles. Simulation results show that it effectively improves the path reliability with some extra bandwidth consumptions.
时间敏感网络中frr机制的多级联预配置周期
TSN(时间敏感网络)定义了一组向以太网添加确定性低延迟服务的标准。高可靠性也是TSN的一个基本特征。IEEE 802.1CB为TSN引入了frr (Frame Replication and Elimination for Reliability)机制。它通过两条不相交的路径传输重复帧,并在目的节点消除一份拷贝,以提高业务可靠性。然而,考虑到不同的网络拓扑结构和网络状态,在源节点和目的节点之间找到两条不相交的路径并不总是一件容易的事情。此外,FRER机制只考虑跳数最短的路径,而不考虑链路的可靠性、负载和中心性等属性。本文提出了一种称为多级联预配置周期(FRER- mpc)的方法来寻找TSN中frr机制的两条优化路径。FRER-MPC机制根据链路优先级模型选择工作路径,并通过多个预配置的循环计算出冗余路径。仿真结果表明,该方法在增加带宽消耗的同时,有效地提高了路径可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信