Local bifurcation analysis of some dual congestion control algorithms
Local bifurcation analysis of some dual congestion control algorithms
复制标题
DOI：
10.1109/tac.2005.852566
复制
发表时间：
2005-08
影响因子：
6.8
通讯作者：
G. Raina
中科院分区：
文献类型：
--
作者：
G. Raina
我们进行了必要的计算，以确定具有单个离散时滞的非线性时滞微分方程解从稳态分支的稳定性和渐近形式。结果被用来检查在单条链路上采用的一系列拥塞控制算法中本地稳定性的损失。重点分析了公平算法和基于延迟的对偶算法。当这些算法只是失去局部稳定性时，我们得到了保证稳定极限环开始的显式条件。进一步，我们能够量化系统参数对分支周期解的幅度的影响。
We perform the necessary calculations to determine the stability and asymptotic forms of solutions bifurcating from steady state in a nonlinear delay differential equation with a single discrete delay. The results are used to examine the loss of local stability in a selection of congestion control algorithms employed over a single link. In particular, we analyze the fair and the delay-based dual algorithms. Explicit conditions are derived to ensure the onset of stable limit cycles as these algorithms just lose local stability. Further, we are able to quantify the effect parameters of the system have on the amplitude of the bifurcating periodic solutions.