OMNeT++ simulation model for evaluation of scheduling algorithms in FTT-SE networks

Abstract

Distributed embedded systems (DESs) must be designed to meet temporal constraints enforced by an application. This usually means applying a message scheduling scheme optimized for a specific configuration that typically depends on the used network topology and various message attributes (e.g. message size). The optimization of the schedule is performed off-line, during the network configuration process, and usually cannot be easily adapted in case of sudden environment changes that would affect the current network configuration. The Flexible Time-Triggered (FTT) protocol brings the necessary flexibility to a DES by means of on-line scheduling policy management that is required for operation in dynamic environments. This paper presents an OMNeT++ simulation model aimed at evaluating the scheduling algorithms in FTT-SE networks. The model is assessed using different scenarios and two commonly used scheduling schemes, namely, Rate Monotonic Assignment (RMA) and Earliest Deadline First (EDF).