摘要
由于IP多播难以在因特网环境中配置,应用层多播作为IP多播的一种替代方案得到越来越多的研究。从网络设计的角度来看,应用层多播在网络代价模型及路由策略方面与传统的IP多播有很大区别。本文研究了带度约束的最小直径应用层网络多播路由问题,提出了解决该问题的启发式遗传算法。通过大量仿真实验,我们对比分析了两种贪婪算法和遗传算法的性能。实验显示,启发式遗传算法具有较好的性能。
For the difficulty of deploying IP muhicast services in the Internet, Application Layer Multicast has been studied as an alternative approach. Application 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.
出处
《计算机工程与科学》
CSCD
2006年第2期20-23,共4页
Computer Engineering & Science
关键词
应用层多播
遗传算法
度约束
application layer multicast
genetic algorithm
degree constraint
