首页 | 官方网站   微博 | 高级检索  
     

用遗传算法解带时延及时延抖动约束的组播路由优化问题
引用本文:陈佳,康立山,陈毓屏.用遗传算法解带时延及时延抖动约束的组播路由优化问题[J].计算机工程与应用,2003,39(21):147-150.
作者姓名:陈佳  康立山  陈毓屏
作者单位:武汉大学软件工程国家重点实验室,武汉,430072
基金项目:国家自然科学基金(编号:60133010,60073043,70071042)资助
摘    要:带约束条件的组播路由是网络应用的发展所提出的新的问题,根据不同的约束条件有不同的变种,该文讨论了带时延及时延抖动约束的组播路由优化问题,给出了该问题的数学模型,提出了求解该问题的一种基于候选路由库的遗传算法,并对该算法的仿真结果与前人的结果进行了比较。结果证明,用遗传算法解决这类问题是有效的。

关 键 词:组播路由  延时  延时抖动  遗传算法  候选路由库
文章编号:1002-8331-(2003)21-0147-04
修稿时间:2002年9月1日

A Genetic Algorithm for the Multicast Routing Optimization Problem with Delay and Delay-Variation Constraints
Chen Jia Kang Lishan Chen Yuping.A Genetic Algorithm for the Multicast Routing Optimization Problem with Delay and Delay-Variation Constraints[J].Computer Engineering and Applications,2003,39(21):147-150.
Authors:Chen Jia Kang Lishan Chen Yuping
Abstract:The Constrained Multicast Routing Problem is put forward with the rapid development of internet applications.With different constraints,there are many variations of the CMRP.In this paper,we discuss the Multicast Routing Optimization Problem with Delay and Delay Variation Constraints.Firstly we give its mathematical model.Then we describe a genetic algorithm based on the Candidate-Route Library to solve it.At last,we compare our emulation results with a famous algorithm for the same problem.Our results show that GA is efficient for such problems.
Keywords:Multicast Routing  Delay  Delay Variation  Genetic Algorithm  Candidate-Route Library  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号