基于遗传算法的时延受限代价最小组播路由选择方法  

A multicast routing approach with delay-constrained minimum-cost based on genetic algorithm

作　　者：王新红[1] 王光兴[1] 

机构地区：[1]东北大学网络与通信中心,辽宁沈阳110006

出　　处：《通信学报》2002年第3期112-117,共6页Journal on Communications

基　　金：国家"九五"重点科技攻关项目基金资助项目(97-769)

摘　　要：目前多媒体业务的涌现对网络提出了更高的要求,希望既能满足实时性,又能够高效地利用网络资源。本文提出了一种基于遗传算法的组播路由选择方法,该方法在满足时延限制条件的基础上寻找代价最小的组播树。实验表明,该算法收敛速度快,可靠性高,能够满足多媒体网络对实时性的要求。At present, more and more multimedia services need the network to guarantee the real-time requirement and use the network resource efficiently. In this paper, an approach based on genetic algorithm is proposed, which finds the low-cost multicasting tree with end-to-end delay constraints. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

关 键 词：组播 遗传算法 时延限制 路由选择 

分 类 号：TN915.05[电子电信—通信与信息系统]