论文标题
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.
