首页 | 本学科首页   官方微博 | 高级检索  
     

基于信息熵多种群遗传算法的组播路由
引用本文:岳承君,尹凤杰,井元伟.基于信息熵多种群遗传算法的组播路由[J].计算机工程,2009,35(11):205-206.
作者姓名:岳承君  尹凤杰  井元伟
作者单位:1. 辽宁大学信息学院,沈阳,110036
2. 东北大学信息科学与工程学院,沈阳,110004
基金项目:辽宁省教育厅资助项目 
摘    要:针对网络信息不确定性和链路负载不均匀所造成的网络拥塞,提出基于信息熵的组播路由算法。该遗传算法从最小代价树开始,在多种群中不断选择信息熵较大的种群,以求得满足延时要求且路径负载较小的组播树。结果表明,该算法性能快速、有效地构造最小时延组播树,且保证网络负载均衡分布。

关 键 词:组播路由  信息熵  多种群遗传算法
修稿时间: 

Multicast Routing Based on Information Entropy Multi-population Genetic Algorithm
YUE Cheng-jun,YIN Feng-jie,JING Yuan-wei.Multicast Routing Based on Information Entropy Multi-population Genetic Algorithm[J].Computer Engineering,2009,35(11):205-206.
Authors:YUE Cheng-jun  YIN Feng-jie  JING Yuan-wei
Affiliation:1.School of Information;Liaoning University;Shenyang 110036;2.School of Information Science and Engineering;Northeastern University;Shenyang 110004
Abstract:Taking account of the uncertain information and the unbalance of link results in the congestion of network,a Genetic Algorithm(GA) with the information entropy is presented to solve the problem in the multicast routing.The algorithm begins from a least-delay tree,searches the max information entropy multicast tree in the multi-population,and gets final multicast tree satisfying delay constraint and the least balance.The results show that the proposed algorithm performs better in terms of delaying a running ...
Keywords:multicast routing  information entropy  multi-population Genetic Algorithm(GA)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号