Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (9): 114-116.
• 网络、通信与安全 • Previous Articles Next Articles
马炫 Xuan Ma
Received:
Revised:
Online:
Published:
Contact:
马炫 孙丽敏 张亚龙
通讯作者:
Abstract: Degree-constrained QoS multicasting routing is important in communication network. A genetic algorithm is proposed for solving the problem. The method of forming a path by connected node is employed to design a Steiner tree representation. The crossover and mutation operators that can carry out the evolution of chromosomes with tree structure, and the method of modifying degree of nodes are designed. Numerical simulation results show that the algorithm has the capability of finding optimal solution. It is suitable for a large-scale network to solve degree-constrained QoS multicasting routing problem.
摘要: 有度约束的QoS组播路由问题在通信网络中具有重要意义。本文提出一种基于遗传算法的度约束组播路由算法,采用节点连接路径形式的编码方法构成一棵组播树的表示,设计了相应的具有树形结构的交叉和变异算子,以及节点度的改变算法。本文算法可以实现具有树形结构染色体的遗传进化。数值实验表明算法具有找到最优解的能力,特别适合于求解大规模网络有度约束的QoS组播路由问题。
马炫 Xuan Ma. A genetic algorithm for degree-constrained QoS multicasting routing[J]. Computer Engineering and Applications, 2007, 43(9): 114-116.
马炫 孙丽敏 张亚龙. 度约束QoS组播路由遗传算法[J]. 计算机工程与应用, 2007, 43(9): 114-116.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I9/114