Fair end-to-end window-based congestion control
Fair end-to-end window-based congestion control
复制标题
DOI：
10.1117/12.325891
复制
发表时间：
1998-10
期刊：
影响因子：
--
通讯作者：
Jeonghoon Mo;J. Walrand
中科院分区：
文献类型：
--
作者：
Jeonghoon Mo;J. Walrand
在本文中，我们证明了存在公平的端到端的基于窗口的拥塞控制协议的分组交换网络与FCFS路由器。我们的公平性的定义概括了比例公平性，并包括任意接近的最大最小公平性。这些协议只使用终端主机可用的信息，并设计为合理快速地收敛。我们的研究是基于网络的多类流体模型。使用李雅普诺夫函数证明了协议的收敛性。技术挑战在于协议的构建。
In this paper, we demonstrate the existence of fair end-to- end window-based congestion control protocols for packet- switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.