The Application Of Genetic Algotithm In QoS Multicast Routing

In computer networks, multicast routing is nerwork-layer functions that constructs paths,along which the same message from source node can be sent to multiple destination nodes, andthe key of multicast problem lies in the determination of multicast paths. The general way torealize multicast is to establish multicast tree, which is a spanning tree that take the root assource node and share many links in transmitting the message to the desination set. The multicasttree has two advantages. At first, the message is transmitted to different multicast membership byparallel mode, thus decreasing the delay of message transmission. The second, the message onlyneed to be replicated at forking nodes, so it saves the bandwidth, and optimizes the networkperformance. Multicast routing algorithms are used to compute multicast trees of goodperformance that satisfy QoS requirements for all kinds of business.This paper examines how this new optimization algorithm of genetic algorithm applied tothe delay constrained QoS multicast routing algorithm, A new approach to resolve QoS multicastrouting problem has been provided through parallel search and group improvement of thealgorithm.The paper emphasizes an improved algorithm of the Dijkstra algorithm and the delayconstrained QoS multicast routing algorithm based on genetic algorithms and provide theempirical analysis and simulation validation. The algotithm mentioned in this paper to solve thedelay constrained multicast routing problem has some improvements, particularly in the case oflarger networks and larger optional paths. the algotithm mentioned in this paper searches fastlyand can greatly reduce the route computing time, to meet the multimedia network real-timerequirements.