The Impact of Traffic Compositions on the Performance of Schedule Partition and Schedule Porosity in Time-Triggered Ethernet

On the basis of Time-Trigger Protocol (TTP), Time Triggered Ethernet (TTE) inherits the characteristics of the popularity, maturity and flexibility of traditional Ethernet technology, so as to support the comprehensive transmission of various services with different properties, high reliability and high performance in the same network. For the precise global clock synchronization to ensure the service quality of high priority services, TTE has gradually been widely used in aerospace, rail transit, automotive vehicle driving and other fields. Traffic scheduling is a key issue of TTE technology to meet the deterministic network performance. In this paper, network calculus theory is applied to the performance analysis of schedule partition and schedule porosity method with different ratios of Time-Triggered (TT) and Rate-Constraint (RC) traffics. We focus on the latency of RC frames under the condition that the TT traffic transmission requirements are firstly met. The simulation results justify the analysis validation. It is shown that neither of two methods is not always work well for ever, which it depends on the amount of TT traffics in the total traffics.