检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]吉林大学通信工程学院
出 处:《控制理论与应用》2010年第8期971-978,共8页Control Theory & Applications
基 金:国家杰出青年科学基金资助项目(60725311)
摘 要:针对Internet网络这种大延迟,变化复杂,存在严重干扰的系统,基于约束模型预测控制理论,提出了一种新的主动队列管理算法(DMAQM算法).首先根据预测模型和状态估计器,预测瓶颈链路队列的未来动态特性,它是确定丢包率的基础;然后将拥塞控制的控制要求转化为优化目标函数,在线求解优化问题得到丢包率.DMAQM算法通过滚动优化来适应网络环境的变化,提高了算法鲁棒性;同时在求取丢包率时显式地考虑了网络中存在的约束.仿真结果显示DMAQM算法控制性能优于RED算法,在满足约束的前提下,具有较强的抗干扰能力,同时具有较好的稳定性和鲁棒性.We propose a novel active queue management algorithm based on the dynamic matrix control(DMAQM) for the Internet system with large time-delay, complex variations and detrimental disturbances. By the predictive model and state estimator, the future queue length in data buffer, which is the basis for determining the packet-loss rate, is predicted. Furthermore, the control requirements are converted to the optimal control objectives, and then, the packet-loss rate is obtained by solving the optimization problem online. The DMAQM algorithm adapts to the varying network environment and improves the robustness by moving the optimization horizon, and handles network constraints in the process for determining the packet-loss rate. Finally, the performances of DMAQM are evaluated through a series of simulations. The simulation results show that the DMAQM algorithm is superior to the random early detection(RED) algorithm in stability, disturbance rejection, and robustness.
分 类 号:TP393.06[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15