基于H_∞控制的主动队列管理算法  

A New AQM Algorithm Based on H_∞ Control

作　　者：侯萍[1,2] 王执铨[1] 

机构地区：[1]南京理工大学自动化学院,南京210094 [2]南京人口管理干部学院,南京210042

出　　处：《上海交通大学学报》2011年第8期1191-1195,1201,共6页Journal of Shanghai Jiaotong University

摘　　要：针对网络参数的不确定性和链路带宽的时变性,设计了一种主动队列管理(AQM)算法.该算法将可获得的链路带宽作为标称值,而不可获得的未知时变链路带宽作为干扰信号,以状态空间的形式描述TCP/AQM模型,用时间域H∞控制方法解决网络拥塞问题.NS2仿真结果表明,该算法在往返时间时变和具有扰动业务流情况下,能够快速收敛于期望队列长度,且性能优于已有的控制算法.An active queue management algorithm was presented for network congestion,which is based on uncertain parameters and variable link bandwidth.The available link bandwidth is modeled as a nominal constant value,which is known to the link,plus a time-variant disturbance,which is unknown.The model of TCP/AQM including the state and the input delay was presented in state variables.Then,the network congestion problem is solved by using the time-domain H∞ control approach.The NS2 simulation results show that this algorithm is capable of achieving the desired queue length fast under the conditions of variable RTT and sudden traffic flow.The performances of the proposed algorithm increase greatly compared with the existing algorithm.

关 键 词：H∞控制 网络拥塞 往返时间 不确定性参数 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]