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

第35 卷第9 期 电 子 与 信 息 学 报 Vol.35No.9 2013 年9 月 Journal of Electronics Information Technology Sept. 2013 基于子节点编码和声搜索的QoS 组播路由算法 莫 涵* 兰巨龙 贺 炜 (国家数字交换系统工程技术研究中心 郑州 450002) 摘 要：传统启发式方法求解 QoS 组播路由问题复杂度高，收敛速率慢，无法满足实际需求。该文提出一种基于 子节点编码的和声搜索算法以解决该问题。在和声搜索算法的基础上，该算法设计了新的初始解及新解生成方式， 提升了算法执行效率；提出了参数动态调整方案，兼顾了全局搜索以及局部搜索能力；同时设计了一种基于子节点 的组播树编码方式，加快了新解生成过程。通过理论分析仿真实验，证明了该文算法的低复杂度，表明该文算法在 收敛速率和代价方面具有明显优势。 关键词：QoS 组播路由；和声搜索；组播树编码；收敛速率；组播代价 中图分类号：TP393 文献标识码： A 文章编号：1009-5896(2013)09-2227-07 DOI: 10.3724/SP.J.1146.2012.01588 A Harmony Search Algorithm Based on Child-node Encoding for QoS Multicast Routing Mo Han Lan Ju-long He Wei (National Digital Switching System Engineering Technological RD Center, Zhengzhou 450002, China) Abstract: As the high complexity and low convergence speed, traditional methods could not solve QoS multicast 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