Determining a tight worst-case delay of switched Ethernet network in IEC 61850 architectures

Théo Docquier, Yeqiong Song, V. Chevrier, Ludovic Pontnau, Abdelaziz Ahmed Nacer
{"title":"Determining a tight worst-case delay of switched Ethernet network in IEC 61850 architectures","authors":"Théo Docquier, Yeqiong Song, V. Chevrier, Ludovic Pontnau, Abdelaziz Ahmed Nacer","doi":"10.1109/LCN48667.2020.9314800","DOIUrl":null,"url":null,"abstract":"IEC 61850 has become the reference standard for Substation Automation Systems (SAS) in smart power grids. Switched Ethernet is used for machine to machine communication within SAS. In order to meet stringent real-time constraints, the IEC 61850 application layer protocols can be mapped into different IEEE802.1Q priorities according to their real-time constraints and application criticality. However, the delay evaluation to guarantee real-time requirements can be difficult to perform, especially for lower priority but still real-time constrained traffic. In fact, most existing end-to-end worst-case delay analyses provide upper-bounds, leading to some pessimism and consequently network resource over-provision. In this paper, we present a new method for determining a tight worst-case delay. This method is based on the study of flow characteristics from a given network path. As a flow is interfered by other concurrent flows on its path, their relative offsets with the considered flow greatly impact on its delay. Studying all combinations to find the actual worst-case delay results in high complexity. We show that this complexity can be reduced by only analysing local worst-case delay at each switch in stead of the whole path where the change at each switch would need re-analysing the already analysed switches. An algorithm is also proposed to perform the analysis. An illustrating example shows that our method can reduce the pessimism as it provides the tight worst-case delay instead of the upper-bound of the worst-case delay.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN48667.2020.9314800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

IEC 61850 has become the reference standard for Substation Automation Systems (SAS) in smart power grids. Switched Ethernet is used for machine to machine communication within SAS. In order to meet stringent real-time constraints, the IEC 61850 application layer protocols can be mapped into different IEEE802.1Q priorities according to their real-time constraints and application criticality. However, the delay evaluation to guarantee real-time requirements can be difficult to perform, especially for lower priority but still real-time constrained traffic. In fact, most existing end-to-end worst-case delay analyses provide upper-bounds, leading to some pessimism and consequently network resource over-provision. In this paper, we present a new method for determining a tight worst-case delay. This method is based on the study of flow characteristics from a given network path. As a flow is interfered by other concurrent flows on its path, their relative offsets with the considered flow greatly impact on its delay. Studying all combinations to find the actual worst-case delay results in high complexity. We show that this complexity can be reduced by only analysing local worst-case delay at each switch in stead of the whole path where the change at each switch would need re-analysing the already analysed switches. An algorithm is also proposed to perform the analysis. An illustrating example shows that our method can reduce the pessimism as it provides the tight worst-case delay instead of the upper-bound of the worst-case delay.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
确定IEC 61850体系结构中交换式以太网的严格最坏情况延迟
IEC 61850已成为智能电网中变电站自动化系统(SAS)的参考标准。交换以太网用于SAS内的机器对机器通信。为了满足严格的实时约束,IEC 61850应用层协议可以根据其实时约束和应用临界性,映射为不同的IEEE802.1Q优先级。然而,保证实时需求的延迟评估可能很难执行,特别是对于低优先级但仍然实时受限的流量。事实上,大多数现有的端到端最坏情况延迟分析提供了上限,导致一些悲观情绪,从而导致网络资源过度供应。本文提出了一种确定紧最坏延时的新方法。该方法基于对给定网络路径的流特性的研究。当一个流在其路径上受到其他并发流的干扰时,它们与被考虑流的相对偏移量对其延迟有很大影响。研究所有的组合来找出实际的最坏情况延迟导致高复杂性。我们表明,这种复杂性可以通过只分析每个开关的局部最坏情况延迟来降低,而不是整个路径,因为每个开关的变化需要重新分析已经分析过的开关。本文还提出了一种算法来进行分析。一个实例表明,该方法提供了紧的最坏情况延迟,而不是最坏情况延迟的上界,可以减少悲观情绪。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Leveraging MEC in a 5G System for Enhanced Back Situation Awareness L3SFA: Load Shifting Strategy for Spreading Factor Allocation in LoRaWAN Systems PLEDGE: An IoT-oriented Proof-of-Honesty based Blockchain Consensus Protocol Don’t Stop at the Top: Using Certificate Transparency Logs to Extend Domain Lists for Web Security Studies SETA: Scalable Encrypted Traffic Analytics in Multi-Gbps Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1