摘要
路由选择算法是用于决定计算机网络每个结点输入的信息包应当从哪一个输出线路发送出去,以便使得某种指定的费用最小。提出了一种新的有效启发式遗传路由算法,以使网络总时延最小。该算法采用了启发式遗传路由方案,从而获得近似最优解。采用遗传算法的方法可以减少网络路由算法的运算规模,实现逐步求解。与其他已知类似算法相比较,该算法具有较小的时间复杂性。
The routing algorithms are employed in determining the proper routes along which the information packets input at a node of a computer network are transmitted so that the specified costs are minimum. A new routing algorithm is presented, by which the routes with the minimum total delays can be found out. In order to get an efficient and optimal solution, the heuristic genetic algorithm is used. The heuristic genetic algorithm decreases the routing sizes of the networks, with which a solution with the minimal total delay can be obtained gradually. Simulation results and analysis show the present algorithm requires less time complexity or better performance than those available.
出处
《交通科技与经济》
2005年第6期49-50,75,共3页
Technology & Economy in Areas of Communications
关键词
遗传算法
路由
时延
genetic algorithm
routing
delay
