Network Calculus and mixed-integer LP applied to a switched aircraft cabin network

Abstract

This work addresses the applicability of a switched queuing network as the sole communication network in an aircraft cabin, and proposes an algorithm based on a mixed-integer program to determine hard bounds for the end-to-end delay. These hard bounds guarantee mandatory performance bounds for safety-relevant functions in the aircraft cabin, such as audio announcements or smoke detection. Techniques from the field of deterministic Network Calculus are used to benchmark the results from our novel approach. The results show that our solution allows improved mapping of non-preemptive queuing networks, compared to relevant state-of-the-art approaches.