Worst-case timing analysis of ring networks with cyclic dependencies using network calculus
Ahmed Amari, Ahlem Mifdaoui · 2017
The ring networks guarantee a high availability level, while limiting cabling costs. However, their performance analysis is still a relevant concern due to cyclic dependencies. In this paper, we handle this challenging issue based on Network Calculus formalism. We propose a new approach, Pay Multiplexing Only at Convergence points (PMOC), to compute accurate delay bounds while integrating the impact of cyclic dependencies. We first define and prove the end-to-end service curve, guaranteed for a now of interest under Arbitrary multiplexing. Afterwards, we detail the methodology of delay bounds computation and illustrate it in a special case of ring networks, called regular ring networks. Finally, we analyse the sensitivity and tightness of the derived delay bounds, and compare them against the related work results. We highlight a noticeable enhancement of delay bounds accuracy, thus network resource efficiency and scalability.