Improving Worst-Case Latency Analysis for Rate-Constrained Traffic in the Time-Triggered Ethernet Network

Abstract

Traditional performance analysis models based on the network calculus approach are not fit for the time-triggered Ethernet (TTEthernet) network due to the porosity characteristic of timed-triggered (TT) traffic in the TT-schedule. This paper introduces the porosity concept into the arrival curve model of TT traffic and gives a general method for the worst-case end-to-end latency analysis of rate-constrained (RC) traffic. Experiments show that our models give tighter latency bounds than results from other already known models and may be used to guide the design of the TT-schedule.