具有通信时延的网络拥塞控制算法稳定性研究

Study on stability of network congestion control with communication delay

稳定性是网络传输协议的一个关键性问题,在传统的协议设计方法中,首先实现协议的算法,然后再来分析协议的稳定性,调节相应参数。对Internet网络拥塞控制算法的动力学特性进行研究,在考虑网络时延的基础上,提出了一种广义原始-对偶模型,并分析该模型在任意拓扑网络结构中的稳定性,进而根据理论分析结果来设计具有渐进稳定性的拥塞控制算法。同时,就算法的稳定性进行了理论分析和仿真,给出了判断该分布式算法稳定的定理和参数的选择范围。仿真结果表明该广义原始-对偶拥塞控制算法是渐进稳定的。

Stability is a crucial issue for transport protocols.A lot of works study how to tune the parameters of congestion control algorithms to keep the stability of networks.The mechanisms of Internet congestion control are understood as primaldual algorithms which try to maximize the utility of Internet.The local stability of general primal-dual algorithms is studied in the presence of general network topology and arbitrary delay.The analysis is based on the frequency response functions of the system and the model of general primal-dual algorithms.Congestion control algorithms are presented according to different stable conditions.The effectiveness of the stability criteria is validated by simulation results.