A genetic algorithm with fuzzy selection and local search for multicast routing problem on the QoS constraint
Many network services must ensure stable QoS (Quality of Service) and provide acceptable link costs, time delay, bandwidth and pack loss constraints, essentially a multicast routing problem. Computing such multicast routing problems is an NP-complete problem. In this paper, we propose a genetic algorithm using fuzzy selection and local search (GFLS), to address the multicast routing problem with QoS under delay constraints. The GFLS algorithm finds a multicast tree with minimum cost under delay constraints. The primary simulation results demonstrate that the GFLS can efficiently solve a multicast routing problem under QoS constraints.
genetic algorithm multicast routing quality of service steiner tree