用遗传算法解带时延及时延抖动约束的组播路由优化问题

A Genetic Algorithm for the Multicast Routing Optimization Problem with Delay and Delay-Variation Constraints

带约束条件的组播路由是网络应用的发展所提出的新的问题,根据不同的约束条件有不同的变种,该文讨论了带时延及时延抖动约束的组播路由优化问题,给出了该问题的数学模型,提出了求解该问题的一种基于候选路由库的遗传算法,并对该算法的仿真结果与前人的结果进行了比较。结果证明,用遗传算法解决这类问题是有效的。

The Constrained Multicast Routing Problem is put forward with the rapid development of internet applications.With different constraints,there are many variations of the CMRP.In this paper,we discuss the Multicast Routing Optimization Problem with Delay and Delay Variation Constraints.Firstly we give its mathematical model.Then we describe a genetic algorithm based on the Candidate-Route Library to solve it.At last,we compare our emulation results with a famous algorithm for the same problem.Our results show that GA is efficient for such problems.