论文标题

关于耦合的AIMD流的独特登山性

On Unique Ergodicity Of Coupled AIMD Flows

论文作者

Ferraro, Pietro, Yu, Jia Yuan, Ghosh, Ramen, Alam, Syed Eqbal, Marecek, Jakub, Wirth, Fabian, Shorten, Robert

论文摘要

为传输控制协议(TCP)支撑的AIMD算法可能是有史以来最成功的控制算法。最近,它的使用已扩展到通信网络之外,并且在运输,能源和数学生物学中据报道了AIMD算法的成功应用。 AIMD使用的最新发展是其在不需要试用间通信的情况下解决大规模优化和分布式控制问题的应用。在这种情况下,当多个在某种意义上(通常是通过非线性)耦合的多个AIMD网络时,就会出现一个有趣的问题。本说明的目的是证明某些设置中的此类系统继承了各个AIMD网络的恒星属性。该结果对上述优化算法的收敛有重要的后果。本文中的论点还正确[1]中的概念和技术错误。

The AIMD algorithm, which underpins the Transmission Control Protocol (TCP) for transporting data packets in communication networks, is perhaps the most successful control algorithm ever deployed. Recently, its use has been extended beyond communication networks, and successful applications of the AIMD algorithm have been reported in transportation, energy, and mathematical biology. A very recent development in the use of AIMD is its application in solving large-scale optimization and distributed control problems without the need for inter-agent communication. In this context, an interesting problem arises when multiple AIMD networks that are coupled in some sense (usually through a nonlinearity). The purpose of this note is to prove that such systems in certain settings inherit the ergodic properties of individual AIMD networks. This result has important consequences for the convergence of the aforementioned optimization algorithms. The arguments in the paper also correct conceptual and technical errors in [1].

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源