Queue Dynamics With Window Flow Control
Queue Dynamics With Window Flow Control
复制标题
DOI：
10.1109/tnet.2010.2047951
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
A. Tang;L. Andrew;Krister Jacobsson;K. Johansson;H. Hjalmarsson;S. Low
中科院分区：
文献类型：
--
作者：
A. Tang;L. Andrew;Krister Jacobsson;K. Johansson;H. Hjalmarsson;S. Low
本文提出了一种新的模型，描述了数据源使用窗口流控制时通信网络的拥塞过程。该模型考虑了子往返时间（RTT）时间尺度的突发性和流在不同链路的瞬时速率差异。它是通用的，独立于实际的源流量控制算法。讨论了该模型的基本性质及其与现有工作的关系。特别是，对于一个一般的网络与多个链接，它表明，振荡的空间相互作用允许队列不稳定性发生，即使当所有的流具有相同的RTT和保持恒定的窗口。该模型被用来研究动态的基于延迟的拥塞控制算法。它被发现，RTTs的比率是至关重要的，这样的系统的稳定性，和以前未知的不稳定模式被识别。数据包级的模拟和测试平台的测量，以验证模型及其预测。
This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstiness in sub-round-trip time (RTT) timescales and the instantaneous rate differences of a flow at different links. It is generic and independent of actual source flow control algorithms. Basic properties of the model and its relation to existing work are discussed. In particular, for a general network with multiple links, it is demonstrated that spatial interaction of oscillations allows queue instability to occur even when all flows have the same RTTs and maintain constant windows. The model is used to study the dynamics of delay-based congestion control algorithms. It is found that the ratios of RTTs are critical to the stability of such systems, and previously unknown modes of instability are identified. Packet-level simulations and testbed measurements are provided to verify the model and its predictions.