Heuristic Algorithm for Virtual Link Configuration in AFDX Networks

REACTION 2014. 3rd International Workshop on Real-time and Distributed Computing in Emerging Applications. Rome, Italy. December 2nd, 2014.As the AFDX networks have been increasingly employed for airborne networks, much research works have been conducted to support real-time service in a deterministic way. However, since they assumed the preconfigured networks where all involved parameters were already determined, the impact of configuration algorithm is not well explored. To solve this problem, in this paper, we focus on how to reduce the required bandwidth by configuring virtual link which logically consists of at least one or more application flows. To achieve this, new heuristic algorithms have been proposed by applying well-known greedy approach while taking essential constraints of AFDX networks into account. To evaulate the performance of proposed scheme, diverse case studies for airborne application flows are concerned and their number of virtual links as well as required bandwidth are compared.This work was supported by Basic Science Research Program (NRF-2013R1A1A2A10004587) through the National Research Foundation of Korea (NRF) funded by the Ministry of Education and the MSIP(Ministry of Science, ICT & Future Planning), Korea, under the ”SW master’s course of a hiring contract” support program (NIPA-2014-HB301-14- 1014) supervised by the NIPA(National IT Industry Promotion Agency).Publicad