北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2004, Vol. 27 ›› Issue (2): 39-43.

• 论文 • 上一篇    下一篇

基于遗传算法的流媒体组播路由选择方法

姜 圳1, 张宏科2, 张礼勇1   

  1. 1.哈尔滨理工大学 测控技术与通信工程学院, 黑龙江 哈尔滨 150040;
    2.北京交通大学 电子信息工程学院, 北京 100044
  • 收稿日期:2003-01-27 出版日期:2004-02-28
  • 作者简介: 姜 圳(1973—),男,博士生。 E-mail:wangxl@dq.njtu.edu.cn
  • 基金资助:
    国家自然科学基金资助项目(60272012); 国家“863计划”资助项目(2001AA121014)

The Application of Genetic Algorithm in Multicast
Routing of Multimedia Stream

JIANG Zhen1, ZHANG Hong-ke2, ZHANG Li-yong1   

  1. 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
  • Received:2003-01-27 Online:2004-02-28

摘要: 在满足一定时延限制情况下,找出包括特定源、目的节点的最小费用树是NP-Complete问题。针对该问题对遗传算法进行理论分析,提出了较其它的遗传算法和启发式算法而言具有编码方式简单、收敛速度快的遗传算法,给出了组播路由的模型,并利用遗传算法对该模型进行计算机仿真分析。

关键词: 组播, 路由, 遗传算法

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 routeis presented and the result of simulation is shown. Compared with the other genetic algorithms and heuristic algorithms, the genetic algorithm proposed in thisarticle is simple and can obtain optimal resultant in a short time. The resultindicates that the genetic algorithm has characteristic such as high-efficient in multicast routing.

Key words: multicast, routing, genetic algorithm

中图分类号: