基于GA的动态时延受限多播路由算法

A Dynamic Delay-bounded Constraint Multicast Routing Algorithm Based on GA

探讨了包交换计算机网络中 ,具有端到端时延限制的动态多播路由问题 .提出了一种基于遗传算法 ( GA)的动态时延受限多播路由优化算法 .当节点加入或退出时 ,算法先利用 Dijkstra第 k最短路径算法求出节点到源点的最短路径集 ,再用遗传算法搜索最小多播树 。

This paper studies the problem of dynamic multicast routing with end to end delay constraint in packet switched computer networks. It presente a GDDMP algorithm. When a node joins or leaves, the algorithm firstly makes use of Dijkstra the k shortest circuit path algorithm to find the shortest circuit route set from the node to source node, then uses GA to search for the minimum multicast tree.The approach based on genetic algorithm is proved to be able to find the dynamic delay bounded constraint multicast routing tree.