检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴碧霞[1]
机构地区:[1]闽北职业技术学院信息与工程系,福建南平353000
出 处:《莆田学院学报》2011年第5期73-76,96,共5页Journal of putian University
基 金:南平市科技局资助项目(N2010Z13)
摘 要:指出传统蚁群算法在解决QoS单播路由选择问题时,受到时延和带宽的约束,为降低路由费用,容易出现陷入局部最优且收敛速度慢的现象。针对上述问题,提出一种基于精英策略的蚁群优化QoS单播路由算法,该算法利用蚁群算法原理,并引入精英策略。通过仿真模拟一个20节点的计算机网络QoS单播路由选择实例,并与传统蚁群优化(ACO)算法进行对比,仿真结果表明该算法是有效的。In computer networks,QoS unicast routing problems are constrained by the bandwidth and delay.To reduce its costs and the possibility to fall in local best,and then improve its searching ability and convergence speed.In this paper,a new algorithm for QoS unicast routing based on the elitist strategy and ant colony optimization(ACO) was proposed in response to these problems.The concepts and principles of this algorithm come from the elitist strategy and ACO.And some experiments carry out on simulating to solve 20-noed QoS unicast routing problem,comparing the new algorithm with traditional ant colony algorithm.Experimental results show that the new algorithm is effective.
分 类 号:TP393.07[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104