Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (16): 77-79.

• 网络、通信、安全 • Previous Articles     Next Articles

Study on stability of network congestion control with communication delay

LIU Changhua,YUAN Cao   

  1. Department of Computer and Information Engineering,Wuhan Polytechnic University,Wuhan 430023,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-06-01 Published:2011-06-01

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

刘昌华,袁 操   

  1. 武汉工业学院 计算机与信息工程系,武汉 430023

Abstract: 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 primal-
dual 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.

Key words: communication delay, congestion control, primal-dual algorithms, stability

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

关键词: 通信时延, 拥塞控制, 原始-对偶算法, 稳定性