A decentralized adaptive ECN marking algorithm
A decentralized adaptive ECN marking algorithm
复制标题
一种去中心化自适应ECN标记算法
DOI：
10.1109/glocom.2000.891930
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
R. Srikant
中科院分区：
文献类型：
--
作者：
S. Kunniyur;R. Srikant
高速网络（例如互联网）中的公平资源分配可以被视为约束凸计划。 Kelly、Maulloo 和 Tan（参见《运筹学杂志》，第 49 卷，第 237-52 页，1998 年）表明，该问题的无约束罚函数公式可用于设计稳定的拥塞控制器。我们研究了从网络提供反馈的问题，以便从罚函数公式导出的拥塞控制器可以解决原始无约束问题。这可以被视为互联网中每个节点的早期拥塞通知（ECN）标记率的去中心化设计，以确保网络流动模型的全局无损、社会最优运行。
Fair resource allocation in high-speed networks such as the Internet can be viewed as a constrained convex program. Kelly, Maulloo and Tan (see Journal of the Operational Research Society, vol.49, p.237-52, 1998) have shown that an unconstrained penalty function formulation of this problem can be used to design congestion controllers that are stable. We examine the question of providing feedback from the network such that the congestion controllers derived from the penalty function formulation lead to the solution of the original unconstrained problem. This can be viewed as the decentralized design of early congestion notification (ECN) marking rates at each node in the Internet to ensure global loss-free, socially-optimal operation of a fluid model of the network.