计算机工程 ›› 2009, Vol. 35 ›› Issue (7): 26-28.doi: 10.3969/j.issn.1000-3428.2009.07.009

• 博士论文 • 上一篇    下一篇

基于观测器的网络拥塞控制算法

毛艳娥1,2,周振辉1,王宏伟2,井元伟2   

  1. (1. 沈阳航空工业学院计算机学院,沈阳 110034;2. 东北大学信息科学与工程学院,沈阳 110004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-04-05 发布日期:2009-04-05

Observer-based Network Congestion Control Algorithm

MAO Yan-e1,2, ZHOU Zhen-hui1, WANG Hong-wei 2, JING Yuan-wei2   

  1. (1. School of Computer, Shenyang Institute of Aeronautical Engineering, Shenyang 110034; 2. College of Information Science and Engineering, Northeastern University, Shenyang 110004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-04-05 Published:2009-04-05

摘要: 针对动态网络的拥塞问题,设计一种基于观测器的鲁棒主动队列管理控制算法。该算法保证输入受限情况下时变时滞不确定网络系统的渐近稳定。通过Lyapunov稳定性分析,利用线性矩阵不等式技术研究基于观测器的鲁棒控制器的存在条件以及设计方法。仿真结果表明,该算法可以使路由器中的队列长度快速收敛到目标值,同时保持较小的队列振荡。特别在网络条件变化及出现突发流的情况下,该控制器仍能具有良好的鲁棒特性。

关键词: 观测器, 拥塞控制, 主动队列管理, 输入受限, 鲁棒性

Abstract: A robust Active Queue Management(AQM) congestion control algorithm is proposed on the basis of the observer to solve the problem of dynamic network congestion. The algorithm ensures asymptotic stability of time-varying delay uncertainties network systems with input saturation. Through Lyapunov stability analysis, the system can be stabilized with the obtained observer and the state feedback control law by using Linear Matrix Inequality(LMI). Simulation results demonstrate that it can lead to the convergence of the queue length to the set value quickly and maintain the oscillation small, and also shows that the scheme is very roubust against disturbance and burst flows under various network conditions.

Key words: observer, congestion control, Active Queue Management(AQM), input saturation, robustness

中图分类号: