循环依赖网络的稳定性和性能保证
Stability and performance guarantees in networks with cyclic dependencies
摘要:
随着反应式嵌入式系统等实时网络的发展,需要计算确定性的性能边界。本文在网络演算的框架下研究了循环依赖网络的性能保证和稳定性条件。首先,我们提出了一个算法,计算紧积压边界在树网络中的任何一组流穿过服务器。然后,我们展示了如何使用该算法来改进任何拓扑结构(包括循环网络)的文献边界。特别是,我们证明了环是稳定的网络演算框架。
英文摘要:
With the development of real-time networks such as reactive embedded systems, there is a need to compute deterministic performance bounds. This paper focuses on the performance guarantees and stability conditions in networks with cyclic dependencies in the network calculus framework. We first propose an algorithm that computes tight backlog bounds in tree networks for any set of flows crossing a server. Then, we show how this algorithm can be applied to improve bounds from the literature fir any topology, including cyclic networks. In particular, we show that the ring is stable in the network calculus framework.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。