Before revision:  A relevant issue for such networks is handling cyclic dependencies to prove timing predictability, a key requirement for safety-critical systems , e. g., avionics and automotive. To deal with the performance evaluation of such networks, most relevant existing techniques are based on the Network Calculus framework, and consists in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.
After revision:  A relevant issue for such networks is handling cyclic dependencies to prove timing predictability, a key requirement for safety-critical systems . We are interested in this paper in event-triggered ring-based networks, which guarantee high resource utilization efficiency and (re)configuration flexibility, at the cost of increasing the timing analysis complexity. The implementation of such a communication scheme on top of a ring topology actually induces cyclic dependencies, in comparison to time-triggered solutions. To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus framework, and consists in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds.