|
|||||
|
|
| 基于遗传算法的流媒体组播路由选择方法 | |
| 引用本文： | 姜圳,张宏科,张礼勇.基于遗传算法的流媒体组播路由选择方法[J].北京邮电大学学报,2004,27(2):39-43. |
| 作者姓名： | 姜圳 张宏科 张礼勇 |
| 作者单位： | 1.哈尔滨理工大学 测控技术与通信工程学院, 黑龙江 哈尔滨 150040; 2.北京交通大学 电子信息工程学院, 北京 100044 |
| 基金项目： | 国家自然科学基金，国家高技术研究发展计划(863计划) |
| 摘 要： | 在满足一定时延限制情况下,找出包括特定源、目的节点的最小费用树是NP-Complete问题。针对该问题对遗传算法进行理论分析,提出了较其它的遗传算法和启发式算法而言具有编码方式简单、收敛速度快的遗传算法,给出了组播路由的模型,并利用遗传算法对该模型进行计算机仿真分析。 |
| 关 键 词： | 组播 路由 遗传算法 |
| 文章编号： | 1007-5321(2004)02-0039-05 |
| 收稿时间： | 2003-01-27 |
| 修稿时间： | 2003年1月27日 |
The Application of Genetic Algorithm in Multicast Routing of Multimedia Stream |
|
| JIANG Zhen,ZHANG Hong-ke,ZHANG Li-yong.The Application of Genetic Algorithm in Multicast Routing of Multimedia Stream[J].Journal of Beijing University of Posts and Telecommunications,2004,27(2):39-43. | |
| Authors: | JIANG Zhen ZHANG Hong-ke ZHANG Li-yong |
| Affiliation: | 1.College of Measure-control Technology and Communication Engineering, Harbin University of Science & Technology, Harbin 150040, China; 2.School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing 100044, China |
| Abstract: | Finding a minimal cost tree which contains a special source and destination nodes in a certain constraints is a NP-Complete problem. A model of multicast route is presented and the result of simulation is shown. Compared with the other genetic algorithms and heuristic algorithms, the genetic algorithm proposed in this article is simple and can obtain optimal resultant in a short time. The result indicates that the genetic algorithm has characteristic such as high-efficient in multicast routing. |
| Keywords: | multicast routing genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 | |
| 点击此处可从《北京邮电大学学报》下载全文 | |