Novel genetic algorithm for multicast routing problem on the QoS constrain

New technologies are continuously being applied to high-speed networks such as distribution systems, on-line video-services, and some other applications. These 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 (GFS) to address the problem of QoS under delay constraints. The GFS algorithm finds a multicast tree with minimum cost under delay constraints..