NGI中立队竞争演化QoS组播路由算法  

A Procession-Competition Evolutionary QoS Multicast Routing Algorithm in NGI

作　　者：王兴伟[1] 任炜[1] 易秀双[2] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]东北大学计算中心,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2006年第6期635-638,共4页Journal of Northeastern University(Natural Science)

基　　金：新世纪优秀人才支持计划项目;国家自然科学基金资助项目(60473089);国家发改委CNGI示范工程项目(CNGI-04-13-2T;CNGI-04-6-2T;CNGI-04-15-7A)

摘　　要：设计了一种NGI中的非NP类QoS组播路由算法.该算法以最小化费用为目标,基于立队竞争演化算法,寻找一棵延迟、延迟抖动、带宽及出错率受限且费用优化的组播路由树,一体化解决路由与波长分配问题,同时兼顾网络负载均衡.仿真研究表明,该算法是可行和有效的,不仅能够满足QoS约束,而且在组播树费用和运行时间上明显优于基于经典遗传算法的QoS组播路由算法.A non-NP QoS multicast routing algorithm in NGI （next generation Internet） is proposed. Aiming at the minimized cost, the algorithm is based on the procession-competition evolutionary algorithm to find a multicast routing tree involving the branches to constrain delay, delay jitter, bandwidth, error-rate in association with cost optimization, thus solving integrally the problem to assign routing and wavelength in a single process with network load balancing also taken into account. Simulation results showed that the proposed algorithm is feasible and effective and meets QoS requirements. In addition, it is evidently superior to the conventional QoS multieast routing algorithms based on classical genetic algorithm in cost of multicast routing tree and running time.

关 键 词：NGI IP/DWDM光INTERNET QoS 组播 路由 立队竞争演化算法 

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