In modern aeronautic onboard networks, a driving force exists to integrate multiple communication networks onto a single switched Ethernet network.
Goals for future onboard communication networks are low weight, low price, high bandwidth, and certifiable safety.
The certification process for such a novel system requires hard performance guarantees on latency and jitter.
The state-of-the-art approach to determine worst case bounds is Network Calculus, and the tightness of Network Calculus is subject to ongoing research.
We propose a packetized model based on a mixed-integer program, which is able to express the worst-case in a closed-form representation.
The proposed algorithm allows better mapping of packetized switched networks compared to known Network Calculus approaches.
We finally show that the hard performance bounds are guaranteed, which opens the investigated switched cabin network for a wide range of applications.
«
In modern aeronautic onboard networks, a driving force exists to integrate multiple communication networks onto a single switched Ethernet network.
Goals for future onboard communication networks are low weight, low price, high bandwidth, and certifiable safety.
The certification process for such a novel system requires hard performance guarantees on latency and jitter.
The state-of-the-art approach to determine worst case bounds is Network Calculus, and the tightness of Network Calculus is s...
»