东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2007, Vol. 28 ›› Issue (4): 457-460.DOI: -

• 论著 •    下一篇

链路优化时延约束组播路由的遗传算法

岳承君;井元伟;李庆奎;   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;777微电子有限责任公司 辽宁沈阳110004;辽宁沈阳110004;辽宁锦州121007
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2007-04-15 发布日期:2013-06-24
  • 通讯作者: Yue, C.-J.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60274099);;

Research on link optimizing and delay-constrained multicast routing via GA

Yue, Cheng-Jun (1); Jing, Yuan-Wei (1); Li, Qing-Kui (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China; (2) 777 Micro-Electronic Company Ltd., Jinzhou 121007, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-04-15 Published:2013-06-24
  • Contact: Yue, C.-J.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

626

摘要： 针对网络的瓶颈路径易造成网络拥塞的现象,分析了链路负载不平衡的原因,重新给出链路代价定义,提出一种遗传算法求解该类组播路由问题.算法从链路代价权值转化开始,以满意的时延树为遗传算法的初始解集,然后在交叉操作过程中不断地用低链路代价的边代替树中高链路代价的边,以求得满足链路代价最优的组播树.仿真结果表明,该算法在考虑网络的负载均衡情况下,选择链路代价较低的空闲路径,快速、有效地构建满足时延要求,链路代价最小的组播树.

关键词: 组播路由, 时延约束, 链路优化, 负载平衡, 遗传算法

Abstract: Taking account of the bottleneck-path which results in the congestion of network and analyzing the reason of unbalanced load with the link cost redefined, a genetic algorithm (GA) is presented to solve the problem of multicast routing. The algorithm begins from a conversion of the weight of link cost with an initial solution set in terms of delay-satisfied multicast trees provided for GA, then the expensive tree links are substituted iteratively with the cheaper ones during the crossover operation so as to get the multicast tree satisfying delay constraint with lowest cost. Simulated results showed that the proposed algorithm is available to construct effectively and quickly, the multicast tree satisfying delay constraint and lowest link cost, with network load balance taken into account to pick out the cheaper idle route.

中图分类号: