GA-Based Heuristic Algorithms for QoS Based Multicast Routing

作者:

Highlights:

摘要

Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. The proposed algorithm has overcome all of the previous algorithms in the literature.

论文关键词:Multicast routing,Multi-constrained Steiner tree,Genetic algorithm

论文评审过程:Available online 9 May 2003.

论文官网地址:https://doi.org/10.1016/S0950-7051(03)00032-7