摘要： 探讨了主动网络中带服务约束的组播路由问题模型，基于分层思想提出了求解该模型的遗传算法。分析了该算法的复杂性并进行了仿真，实验表明该算法能以较高的概率找到带服务约束的最优组播树。

关键词: 主动网络, 遗传算法, 组播服务路由, 分层

Abstract: This paper brings forward a new model of multicast service routing problems in active networks. Then it employs layering ideas and designs a new genetic algorithm to solve the model. Finally, it analyzes the complexity of the algorithm. The validity of the method is suggested by a great number of numerical experiments.

中图分类号: 

• TP183