Models for the dynamics of congestion control generally involve systems of coupled differential equations. Universally, these models assume that traffic sources saturate the maximum transmissions allowed by the congestion control method. This is not suitable for studying congestion control of intermittent but bursty traffic sources. In this paper, we present a characterization of congestion control for arbitrary time-varying traffic that applies to rate-based as well as window-based congestion control. We leverage the capability of network calculus to precisely describe the input-output relationship at network elements for arbitrary source traffic. We show that our characterization can closely track the dynamics of even complex congestion control algorithms.

翻译：拥塞控制动力学模型通常涉及耦合微分方程组。这类模型普遍假设流量源会饱和拥塞控制方法允许的最大传输量，这并不适用于研究间歇突发型流量源的拥塞控制。本文针对任意时变流量提出了一种拥塞控制表征方法，可同时适用于速率基和窗口基拥塞控制。我们利用网络演算的能力精确描述网络元件在任意源流量下的输入输出关系，并证明所提出的表征方法能够紧密跟踪复杂拥塞控制算法的动态特性。