FIFO网络演算精确性与易处理性的权衡
Trade-off between accuracy and tractability of network calculus in FIFO networks
摘要：
计算准确的确定性性能界限是对延迟和可靠性具有强烈要求的通信技术的强烈需要。除了新的调度协议，如TSN，FIFO策略仍然在工作中的每一类通信。在本文中，我们专注于计算确定性的性能界限FIFO网络的网络演算框架。我们提出了一个新的算法，线性规划的基础上，提出了一个准确性和易处理性之间的权衡。该算法首先提出了树型网络。在第二次，我们推广我们的方法，并提出了一个线性规划计算性能界限的任意拓扑结构，包括循环依赖。最后，我们提供了数值结果，玩具的例子和真正的拓扑结构，以评估我们的方法的兴趣。
英文摘要：
Computing accurate deterministic performance bounds is a strong need for communication technologies having strong requirements on latency and reliability. Beyond new scheduling protocols such as TSN, the FIFO policy remains at work within each class of communication. In this paper, we focus on computing deterministic performance bounds in FIFO networks in the network calculus framework. We propose a new algorithm based on linear programming that presents a trade-off between accuracy and tractability. This algorithm is first presented for tree networks. In a second time, we generalize our approach and present a linear program for computing performance bounds for arbitrary topologies, including cyclic dependencies. Finally, we provide numerical results, both of toy examples and real topologies, to assess the interest of our approach.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
