作　　者： ; ; ;

机构地区： 江西理工大学信息工程学院

出　　处： 《计算机应用研究》 2010年第12期4718-4722,共5页

摘　　要： 传统演化算法在解决选播路由问题时,初始种群仅包含到选播组中部分服务器的可行路径,并且未考虑服务器的负载,设置的QoS约束惩罚函数过于简单,这些方法易导致算法收敛到局部最优路由。针对这些问题,提出一种根据选播组中成员服务器的负载来初始化种群的选播路由算法,首次提出用区分度更高的QoS约束惩罚函数来组成适应度函数。在随机生成的Waxman网络拓扑环境下进行仿真实验,结果表明,与传统算法相比,该算法得到的最优路由具有更大的带宽,更小的时延,且能在更少的代数内收敛。 When solving anycast routing problems with traditional evolutionary algorithms,feasible routes to parts of servers in anycast group were only included in initial population and load of servers was not considered,in addition,the penalty functions of QoS parameter were set too simple; these methods easily resulted in local optimal solutions. In order to overcome these shortcomings,proposed an anycast routing algorithm based on the load of anycast group to initialize population,and firstly in-troduced penalty functions of QoS parameter with higher distinction degree to compose the fitness function. Simulation experiments are carried out in networks that randomly generated by the model of Waxman,the results show that the algorithm can achieve the optimal route with better delay and bandwidth in less generations compared with traditional algorithms.

关 键 词： 选播路由 演化算法 服务质量 负载均衡

领　　域： [自动化与计算机技术] [自动化与计算机技术]