基于遗传算法的时延受限代价最小组播路由选择方法

A multicast routing approach with delay-constrained minimum-cost based on genetic algorithm

目前多媒体业务的涌现对网络提出了更高的要求,希望既能满足实时性,又能够高效地利用网络资源。本文提出了一种基于遗传算法的组播路由选择方法,该方法在满足时延限制条件的基础上寻找代价最小的组播树。实验表明,该算法收敛速度快,可靠性高,能够满足多媒体网络对实时性的要求。

At present, more and more multimedia services need the network to guarantee the real-time requirement and use the network resource efficiently. In this paper, an approach based on genetic algorithm is proposed, which finds the low-cost multicasting tree with end-to-end delay constraints. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.