多约束QoS路由选择算法研究  

Research of multiple constrained QoS routing algorithm

作　　者：邓慈云[1] 刘泽文[1] 宁林一[1] DENG Ci-yun, LIU Ze-wen, NING Lin-yi （Hunan College of Information, Changsha 410200, China）

机构地区：[1]湖南信息职业技术学院,湖南长沙410200

出　　处：《电脑知识与技术》2012年第8期5321-5323,5326,共4页Computer Knowledge and Technology

基　　金：基金颁发部门：湖南省教育厅;项目名称：基于激励势场的智能机器鱼路径规划应用研究;编号：10c0260;基金中请人：刘泽文

摘　　要：对于多约束QoS路由选择问题，将其转化为一个多约束赋权图，通过捕食模型调整最小时延和最小丢包率这两个I／1标的权值，找到非劣解集；然后，利用人工鱼群算法较好地平衡全局搜索能力和局部搜索能力，完成最小成本的路由选择。实验表明：该算法是可行的。The paper transforms multiple constrained QoS routing problem as the most short path problem of multiple constrained as- sign-weight chart through aiming at it,and use the prey-predator model to find the non-inferior set immediately by adjusting the objects right of the minimum delay and the minimum packet loss rate,The Artificial Fish Swarm Algorithm,which can keep the balance between global and local search ability. It has accomplished ultimate routing with the minimum cost by using the ability of searching the global opti- mization.The experiment results show that the algor-ithm is effective.

关 键 词：QOS路由选择 捕食模型 非劣解集 人工鱼群算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]