YoungJun Cha, JuHo Lim, Sunyoung Lee, Dongjin Kim, Ki-Il Kim
{"title":"一种新的可行的AFDX网络虚链路分组算法","authors":"YoungJun Cha, JuHo Lim, Sunyoung Lee, Dongjin Kim, Ki-Il Kim","doi":"10.1109/ICIEV.2015.7334035","DOIUrl":null,"url":null,"abstract":"As the Avionics Full-Duplex Switched Ethernet network has been employed for airborne data networks, most of related research work has mainly focused on the analysis of delay and jitter between the end systems with predetermined configuration. However, due to assumption on preconfigured virtual links, their optimal solutions seem unsuitable for implementation. This implies that configuration problem for the virtual link remains unsolved yet. To meet this requirement, in this paper, we propose new algorithms for configuring the virtual link by determining grouping of each flow while reducing the required bandwidth in AFDX. This algorithm is accomplished by taking two different approaches, bottom-up and top-down. Finally, we prove their suitability for configuration problem through experimental results by demonstrating not much difference between two algorithms in the aspect of required bandwidth.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"New feasible grouping algorithms for virtual link in AFDX networks\",\"authors\":\"YoungJun Cha, JuHo Lim, Sunyoung Lee, Dongjin Kim, Ki-Il Kim\",\"doi\":\"10.1109/ICIEV.2015.7334035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the Avionics Full-Duplex Switched Ethernet network has been employed for airborne data networks, most of related research work has mainly focused on the analysis of delay and jitter between the end systems with predetermined configuration. However, due to assumption on preconfigured virtual links, their optimal solutions seem unsuitable for implementation. This implies that configuration problem for the virtual link remains unsolved yet. To meet this requirement, in this paper, we propose new algorithms for configuring the virtual link by determining grouping of each flow while reducing the required bandwidth in AFDX. This algorithm is accomplished by taking two different approaches, bottom-up and top-down. Finally, we prove their suitability for configuration problem through experimental results by demonstrating not much difference between two algorithms in the aspect of required bandwidth.\",\"PeriodicalId\":367355,\"journal\":{\"name\":\"2015 International Conference on Informatics, Electronics & Vision (ICIEV)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Informatics, Electronics & Vision (ICIEV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEV.2015.7334035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEV.2015.7334035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New feasible grouping algorithms for virtual link in AFDX networks
As the Avionics Full-Duplex Switched Ethernet network has been employed for airborne data networks, most of related research work has mainly focused on the analysis of delay and jitter between the end systems with predetermined configuration. However, due to assumption on preconfigured virtual links, their optimal solutions seem unsuitable for implementation. This implies that configuration problem for the virtual link remains unsolved yet. To meet this requirement, in this paper, we propose new algorithms for configuring the virtual link by determining grouping of each flow while reducing the required bandwidth in AFDX. This algorithm is accomplished by taking two different approaches, bottom-up and top-down. Finally, we prove their suitability for configuration problem through experimental results by demonstrating not much difference between two algorithms in the aspect of required bandwidth.