• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (2): 20-23.

• 论文 • 上一篇    下一篇

带度约束的最小直径应用层多播路由问题的启发式遗传算法

刘志峰 郑彦兴 刘亚杰 窦文华   

  • 出版日期:2006-02-01 发布日期:2010-05-20

  • Online:2006-02-01 Published:2010-05-20

摘要:

由于IP多播难以在因特网环境中配置,应用层多播作为IP多播的一种替代方案得到越来越多的研究。从网络设计的角度来看,应用层多播在网络代价模型及路由策略方面与传统的IP多播有很大区别。本文研究了带度约束的最小直径应用层网络多播路由问题,提出了解决该问题的启发式遗传算法。通过大量仿真实验,我们对比分析了两种贪婪算法法和遗传算法的性能。实验显示,启发式遗传算法具有较好的性能。

关键词: 应用层多播 遗传算法 度约束

Abstract:

For the difficulty of deploying IP muhicast services in the Internet, Application Layer Multicast has been studied as an alternative approach. Applica tion Layer Multicast networks differ from IP networks in many aspects, such as network cost and routing constraints. Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP complete problem. A heuristic genetic algorithm is proposed to solve this problem.  Through extensive simulations, the performance of the proposed algorithm is compared with that of two heuristic greedy algorithms. Experimental results   show that the heuristic genetic algorithm has better performance.

Key words: application layer multicast, genetic algorithm, degree constraint