New feasible grouping algorithms for virtual link in AFDX networks

Cha, Young-Jun; Lim, JuHo; Lee, SunYoung; Kim, DongJin; Kim, Ki-Il

doi:10.1109/iciev.2015.7334035

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Packet flows are transmitted through predefined logical paths called "virtual links" (VLs). 32,33) A virtual link defines a logical and unidirectional connection from one transmittingend system to one or more receiving-end systems. As shown in the example in Fig.…”

Section: Afdx Networkmentioning

confidence: 99%

Performance Evaluation on Packet Transmission for Distributed Real-time Avionics Networks Using Forward End-to-End Delay Analysis

Yang

2021

Trans. Japan Soc. Aero. S Sci.

View full text Add to dashboard Cite

Section: Afdx Networkmentioning

confidence: 99%

Performance Evaluation on Packet Transmission for Distributed Real-time Avionics Networks Using Forward End-to-End Delay Analysis

Yang

2021

Trans. Japan Soc. Aero. S Sci.

View full text Add to dashboard Cite

“…Packet flows are transmitted through predefined logical paths which are called virtual links (VLs) (35,36) . A virtual link defines a logical and unidirectional connection from one transmitting end system to one or more receiving end systems.…”

Section: Afdx Networkmentioning

confidence: 99%

Analysis of forward approach for upper bounding end-to-end transmission delays over distributed real-time avionics networks

Yang

2020

Aeronaut. j.

View full text Add to dashboard Cite

Distributed real-time avionics networks have been subjected to a great evolution in terms of functionality and complexity. A direct consequence of this evolution is a continual growth of data exchange. AFDX standardised as ARINC 664 is chosen as the backbone network for those distributed real-time avionics networks as it offers high throughput and does not require global clock synchronisation. For certification reasons and engineering research, a deterministic upper bound of the end-to-end transmission delay for packets of each flow should be guaranteed. The Forward Approach (FA) is proposed for the computation of the worst-case end-to-end transmission delay. This approach iteratively estimates the maximum backlog (amount of the pending packets) in each visited switch along the transmission path, and the worst-case end-to-end transmission delay can be computed. Although it is pessimistic (overestimated), the Forward Approach can provide a tighter upper bound of the end-to-end transmission delay while considering the serialisation effect. Recently, our research finds the computation of the serialisation effect might induce an optimistic (underestimated) upper bound. In this paper, we analyse the pessimism in the Forward Approach and the optimism induced by the computation of the serialisation effect, and then we provide a new computation of the serialisation effect. We compare this new computation with the original one, the experiments show that the new computation reduces the optimism and the upper bound of the end-to-end transmission delay can be computed more accurately.

show abstract

Performance Evaluation on Packet Transmission for AFDX Networks Using Optimized Forward End-to-End Delay Analysis

Yang

2020

Int. J. Aeronaut. Space Sci.

View full text Add to dashboard Cite

New feasible grouping algorithms for virtual link in AFDX networks

Cited by 3 publications

References 9 publications

Performance Evaluation on Packet Transmission for Distributed Real-time Avionics Networks Using Forward End-to-End Delay Analysis

Performance Evaluation on Packet Transmission for Distributed Real-time Avionics Networks Using Forward End-to-End Delay Analysis

Analysis of forward approach for upper bounding end-to-end transmission delays over distributed real-time avionics networks

Performance Evaluation on Packet Transmission for AFDX Networks Using Optimized Forward End-to-End Delay Analysis

Contact Info

Product

Resources

About