求解带时延约束组播路由问题的启发式遗传算法  

A Delay-Constrained Multicast Routing Algorithm Based on Heuristic Genetic Algorithm

作　　者：刘莹[1] 吴建平[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机研究与发展》2003年第3期381-386,共6页Journal of Computer Research and Development

基　　金：国家自然科学基金 ( 6972 5 0 0 3 ;90 10 40 0 2 ) ;国家"八六三"高技术研究发展计划基金 ( 2 0 0 1AA12 10 13 )

摘　　要：组播是一点到多点的信息传送方式 在视频会议等实时性要求较高的组播应用中 ,保证信息的传输时延尽可能小非常重要 有时延约束的组播路由问题已被证明是NP Complete问题 研究带时延约束的组播路由问题 ,给出了一种遗传算法以求解该问题 ,算法采用了适合问题特点的遗传算子 。Multicast is a source node sending the same message to a group of destination nodes In videoconference and other such applications that require real time transmission, it is very important to guarantee end to end performance Delay constrained multicast routing has been proven to be a NP Complete problem A genetic algorithm is proposed to solve this problem The algorithm proposed adopts the genetic operators specific to the problem to be solved and has a better performance

关 键 词：组播路由 遗传算法 时延约束 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]