摘要
Ｉｎｔｅｒｎｅｔ 中多播路由选择问题可归化为最小 Ｓｔｅｉｎｅｒ 树问题，而该问题是一个 Ｎ Ｐ 难题，当前只存在若干种启发式算法。基于遗传算法和最小树算法，提出并实现了一种新的自适应路由选择算法，经编程运行发现，此算法具有良好的实际应用前景。
In the Internet, optimal multicast routing is a NP hard problem, there exists several heuristic algorithms at present. This paper proposes a new adaptive routing algorithm based on genetic algorithm and minimum tree algorithm. Computer simulations demonstrate this algorithm possesses a good property of practicality over Internet multicast routing.
出处
《南京邮电学院学报》
1999年第2期1-4,共4页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
