Worst-Case Timing Analysis of AFDX Networks With Multiple TSN/BLS Shapers

被引:10
作者
Finzi, A. [1 ]
Mifdaoui, A. [1 ]
机构
[1] Univ Toulouse, ISAE Supaero, F-31055 Toulouse, France
来源
IEEE ACCESS | 2020年 / 8卷
关键词
Aerospace applications; communication networks; min-plus algebra; performance evaluation; shapers; time-sensitive networking;
D O I
10.1109/ACCESS.2020.3000326
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the problem of worst-case timing analysis of extended Avionics Full Duplex Switched Ethernet (AFDX) networks, incorporating Time-Sensitive Networking (TSN) shapers called Burst Limiting Shapers (BLS), to enable the interconnection of different avionics domains with mixed-criticality levels, e.g., current AFDX traffic, Flight Control and In-Flight Entertainment. Conducting such an analysis is a challenging issue when considering multiple BLS-shaped traffic classes, due to the sophisticated inter-dependencies between the different shapers sharing the same output capacity. We tackle this problem through extending the applicability domain of our previous work for computing maximum delay bounds using Network Calculus and considering only one BLS class, called Continuous Credit-based Approach (CCbA), to handle multiple TSN/BLS classes. We provide further insights into the sensitivity and tightness issues of worst-case delay bounds yielded with the Generalized CCbA (GCCbA). Our assessments show that the tightness ratio is up to 85& x0025;, with reference to Achievable Worst-Case delays. We also show the improvements against recent state-of-the-art approaches in terms of tightness and complexity, where the computation time is up to 10(5) faster. Finally, we evaluate the efficiency of GCCbA for realistic avionics case studies, e.g., adding A350 flight control traffic to the AFDX. Results show the good applicability of GCCbA and confirm the efficiency of the extended AFDX, which decreases the delay bounds of the existing AFDX traffic by up to 49.9& x0025;, in comparison with the current AFDX standard.
引用
收藏
页码:106765 / 106784
页数:20
相关论文
共 12 条
[1]  
Anais F., 2017, THESIS
[2]  
[Anonymous], 1991, CAN SPECIFICATION VE
[3]  
[Anonymous], 664 ARINC
[4]  
Bouillard A., 2009, RR7094 INRIA RENN
[5]  
Finzi A., 2018, P IEEE INT WORKSH FA, P1, DOI DOI 10.1109/SIES.2018.8442080
[6]  
Gotz F.-J., 2012, P IEEE 802 AVB M JUL, P1
[7]  
Hua Y, 2011, IEEE INFOCOM SER, P2417, DOI 10.1109/INFCOM.2011.5935062
[8]  
Le Boudec J.-Y., 2001, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, V2050, DOI [10.1007/3-540-45318-0, DOI 10.1007/3-540-45318-0]
[9]   Urgency-Based Scheduler for Time-Sensitive Switched Ethernet Networks [J].
Specht, Johannes ;
Samii, Soheil .
PROCEEDINGS OF THE 28TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS ECRTS 2016, 2016, :75-85
[10]   TTEthernet Dataflow Concept [J].
Steiner, Wilfried ;
Bauer, Guenther ;
Hall, Brendan ;
Paulitsch, Michael ;
Varadarajan, Srivatsan .
2009 8TH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, 2009, :319-+