基于改进遗传算法有时延约束的选播QoS路由算法  

Delay-constrained anycast routing algorithm based on improved genetic algorithm

作　　者：李克文[1] 房士义[1] 

机构地区：[1]中国石油大学(华东)计算机与通信工程学院,山东东营257061

出　　处：《计算机工程与设计》2008年第15期3874-3877,共4页Computer Engineering and Design

摘　　要：在分析选播通信服务模型的基础上,提出了一种能够满足时延、带宽约束的基于改进遗传算法的选播QoS路由算法。该算法中,采用加权深度优先搜索和轮盘赌相结合的方法保证初始种群的多样性,同时对基本变异过程进行了改进,提出了指导变异的方法。仿真实验结果表明,该算法是可行且有效的,它不仅能够提高搜索速度,以较短的时间达到局部最优,同时也能够较好的平衡网络负载。Based on studying anycast communication service, an anycast QoS routing algorithm based on improved genetic algorithm, which can satisfy delay constrained and bandwidth constrained, is presented. The method of Depth First search with weight and roulette method are adopted to make the original colony mulriple. On the same time, a method of instructional aberrance is brought forward. Performance data obtained through simulation show that the algorithm has a good performance, it not only can enhance the search ratio and get more resolution at less transmission time, but also can get more balanced network load.

关 键 词：选播路由 遗传算法 指导变异 时延约束 轮盘赌 

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