Genetic Algorithm Based ARINC 664 Mixed Criticality Optimization Using Network Calculus

Eyüp Can Akpolat, Ömer Faruk Gemici, M. S. Demir, Ibrahim Hökelek, S. Coleri, H. A. Çırpan
{"title":"Genetic Algorithm Based ARINC 664 Mixed Criticality Optimization Using Network Calculus","authors":"Eyüp Can Akpolat, Ömer Faruk Gemici, M. S. Demir, Ibrahim Hökelek, S. Coleri, H. A. Çırpan","doi":"10.1109/ICCWorkshops50388.2021.9473569","DOIUrl":null,"url":null,"abstract":"ARINC 664 is an Ethernet based deterministic networking standard providing data transmission with bounded delays among avionics sub-systems. This paper presents a Genetic Algorithm (GA) based ARINC 664 network delay optimization using the network calculus (NC), where the GA is used to effectively search the mapping of Virtual Links (VLs) to priority levels using the extended priority scheme. While there are only two priority levels in the ARINC 664 standard, the extended priority concept increases the number of priority levels to improve the schedulability of VLs. For each possible assignment of the VLs to the priority levels, the NC analysis provides the worst-case delay results for all VLs. We define three different fitness functions aiming to minimize the maximum, the average, and the standard deviation of the worst-case VL delays, respectively. The results demonstrate that the extended priority concept improves the schedulability of VLs and the GA optimization approach can successfully achieve the desired objectives for the VL delays if the appropriate cost function is selected.","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":"2","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.9473569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

ARINC 664 is an Ethernet based deterministic networking standard providing data transmission with bounded delays among avionics sub-systems. This paper presents a Genetic Algorithm (GA) based ARINC 664 network delay optimization using the network calculus (NC), where the GA is used to effectively search the mapping of Virtual Links (VLs) to priority levels using the extended priority scheme. While there are only two priority levels in the ARINC 664 standard, the extended priority concept increases the number of priority levels to improve the schedulability of VLs. For each possible assignment of the VLs to the priority levels, the NC analysis provides the worst-case delay results for all VLs. We define three different fitness functions aiming to minimize the maximum, the average, and the standard deviation of the worst-case VL delays, respectively. The results demonstrate that the extended priority concept improves the schedulability of VLs and the GA optimization approach can successfully achieve the desired objectives for the VL delays if the appropriate cost function is selected.
基于遗传算法的arinc664混合临界优化
ARINC 664是一种基于以太网的确定性网络标准,在航空电子子系统之间提供有界延迟的数据传输。本文提出了一种基于遗传算法的arinc664网络时延优化方法,利用网络演算(network calculus, NC)有效地搜索虚拟链路到优先级的映射。虽然ARINC 664标准中只有两个优先级级别,但扩展优先级概念增加了优先级级别的数量,以提高vl的可调度性。对于每个可能的vl优先级分配,NC分析提供了所有vl的最坏情况延迟结果。我们定义了三种不同的适应度函数,分别用于最小化最坏情况下VL延迟的最大值、平均值和标准差。结果表明,扩展优先级概念提高了VL的可调度性,如果选择合适的代价函数,遗传算法优化方法可以成功地实现VL延迟的预期目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信