基于细菌趋药性优化的QoS组播路由算法  

QOS MULTICAST ROUTING ALGORITHM BASED ON BACTERIAL CHEMOTAXIS OPTIMISATION

作　　者：黄勇[1] 

机构地区：[1]新余学院数学与计算机科学学院,江西新余338004

出　　处：《计算机应用与软件》2012年第11期269-271,共3页Computer Applications and Software

摘　　要：引进细菌趋药性算法(BCO),用于QoS组播路由问题。BCO是一种新型的对细菌觅食行为进行模拟的优化算法。对不同节点的网络结构图进行仿真,表明在同等条件下,BCO收敛时间低于流行的和谐搜索(HS),人工免疫遗传算法(AIGA)等算法。节点规模越大,优势越明显。当节点规模高达60时,BCO消耗时间仅有HS的35%,AIGA的42.5%。In the paper we introduce a novel bacterial chemotaxis optimisation method（BCO） to QoS multicast routing problem.BCO is a novel optimisation algorithm which simulates the bacterial foraging behaviour.Simulation on network structure graphs with different nodes is conducted.It is demonstrated that the convergence time of BCO is less than that of the algorithms including harmony search（HS） and artificial immune genetic algorithm（AIGA） when the conditions keep the same.The bigger the nodes scale,the greater predominance the BCO shows.When the node scale are as big as 60,the consumed time of BOC is only 35% of that of HS,and 42.5% of that of AIGA.

关 键 词：QOS组播路由 细菌趋药性优化 和谐搜索 人工免疫遗传算法 

分 类 号：TN911.73[电子电信—通信与信息系统]