扩展网络演算以处理部分负且递减的服务曲线
Extending Network Calculus To Deal With Partially Negative And Decreasing Service Curves
AI总结:
本文扩展了网络演算(NC),通过利用最小到达曲线处理部分负且递减的服务曲线,为仅提供聚合最小加服务曲线的多流系统提供了紧致的基本性能界限(积压和延迟),并展示了其在异构系统和共享有限缓冲区中的应用。
摘要:
网络演算(NC)是一种多功能分析方法,用于高效计算网络系统中的性能界限。到达曲线和服务曲线抽象允许对多样且异构的分布式系统进行建模。计算残余服务曲线和串联系统序列的操作使得能够高效准确地计算每流时序保证。然而,在涉及系统中多个并发流的某些场景下,所谓的最小加服务曲线这一核心概念过于薄弱,以至于仍无法计算有意义的残余服务曲线。在这些情况下,通常求助于所谓的严格服务曲线,它能够计算每流界限。然而,严格服务曲线具有限制性:(1)存在某些服务元素,只能提供最小加服务曲线而不能提供严格服务曲线;(2)严格服务曲线通常不具备串联特性,即两个严格系统的序列并不产生严格服务曲线。在本报告中,我们扩展了NC,以处理仅向多个流提供聚合最小加服务曲线的系统。此扩展的关键在于利用最小到达曲线,即到达过程的下界。从技术上讲,我们提供了负服务曲线情况下的基本性能界限(积压和延迟)。我们还讨论了它们的准确性并证明它们是紧致的。为了说明其实用性,我们还展示了这些新结果的应用模式:(1)涉及计算和通信资源的异构系统;(2)在多个流之间共享的有限缓冲区。
英文摘要:
Network Calculus (NC) is a versatile analytical methodology to efficiently compute performance bounds in networked systems. The arrival and service curve abstractions allow to model diverse and heterogeneous distributed systems. The operations to compute residual service curves and to concatenate sequences of systems enable an efficient and accurate calculation of per-flow timing guarantees. Yet, in some scenarios involving multiple concurrent flows at a system, the central notion of so-called min-plus service curves is too weak to still be able to compute a meaningful residual service curve. In these cases, one usually resorts to so-called strict service curves that enable the computation of per-flow bounds. However, strict service curves are restrictive: (1) there are service elements for which only min-plus service curves can be provided but not strict ones and (2) strict service curves generally have no concatenation property, i.e., a sequence of two strict systems does not yield a strict service curve. In this report, we extend NC to deal with systems only offering aggregate min-plus service curves to multiple flows. The key to this extension is the exploitation of minimal arrival curves, i.e., lower bounds on the arrival process. Technically speaking, we provide basic performance bounds (backlog and delay) for the case of negative service curves. We also discuss their accuracy and show them to be tight. In order to illustrate their usefulness we also present patterns of application of these new results for: (1) heterogeneous systems involving computation and communication resources and (2) finite buffers that are shared between multiple flows.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。