基于子节点编码和声搜索的QoS组播路由算法  

A Harmony Search Algorithm Based on Child-node Encoding for QoS Multicast Routing

作　　者：莫涵[1] 兰巨龙[1] 贺炜[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《电子与信息学报》2013年第9期2227-2233,共7页Journal of Electronics & Information Technology

基　　金：国家973计划重点项目(2012CB315901);国家863计划项目(2011AA01A103);国家科技支撑计划(2011BAH19B01)资助课题

摘　　要：传统启发式方法求解QoS组播路由问题复杂度高,收敛速率慢,无法满足实际需求。该文提出一种基于子节点编码的和声搜索算法以解决该问题。在和声搜索算法的基础上,该算法设计了新的初始解及新解生成方式,提升了算法执行效率;提出了参数动态调整方案,兼顾了全局搜索以及局部搜索能力;同时设计了一种基于子节点的组播树编码方式,加快了新解生成过程。通过理论分析仿真实验,证明了该文算法的低复杂度,表明该文算法在收敛速率和代价方面具有明显优势。As the high complexity and low convergence speed, traditional methods could not solve QoS mnlticast routing problem to satisfy the network requirement. A Harmony Search algorithm based on Child-Node Encoding （CNE-HS） is proposed for better performance. Three improved aspects present as follows： a new method is designed to create initial solution and new solution, which improves convergence speed; a new dynamic method is proposed to change parameters, which accounts global searching and local searching ability; a new encode mechanism is designed based on children node, which accelerates improvising new solutions. Theoretical analysis and the results of simulations prove the low complexity of CNE-HS, and show that CNE-HS performs much better than GA and HS-based algorithm using Node Parent Index （HSNPI） algorithm in convergence speed and cost.

关 键 词：QOS组播路由 和声搜索 组播树编码 收敛速率 组播代价 

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