A duality model of TCP and queue management algorithms
A duality model of TCP and queue management algorithms
复制标题
DOI：
10.1109/tnet.2003.815297
复制
发表时间：
2003-08
期刊：
影响因子：
--
通讯作者：
S. Low
中科院分区：
文献类型：
--
作者：
S. Low
我们提出了一个对偶模型的端到端拥塞控制和应用它来了解TCP和主动队列管理计划的均衡特性。其基本思想是把源速率作为原始变量，拥塞度量作为对偶变量，拥塞控制作为一种分布式的原始-对偶算法，在网络容量受限的情况下，最大化总效用。原始迭代由TCP算法（如里诺或Vegas）执行，而对偶迭代由队列管理算法（如DropTail、RED或REM）执行。我们提出了这些算法和它们的推广，推导出它们的效用函数，并研究它们之间的相互作用。
We propose a duality model of end-to-end congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management algorithms such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction.