Multiconstrained QoS multicast routing based on genetic algorithms

In computer networks, multicasting is becoming increasing important. A fundamental issue in multicast communication is how to determine an efficient message route(multicast routing). The multicast routing problem in computer networks is also known as the famous Steiner tree problem which has been shown to be NP-complete. Presently many researchers had studied the single constrained multicast problem, especially the delay constrained multicast problem, but the multiple constrained multicast problem has been such less studied. This paper proposed a novel multiple-constraint multicast routing optimization algorithm based on Genetic Algorithms, it can find the least-cost multicasting tree with the bandwidth. delay, delay jitter and packet loss-constrained, and describes a network model for researching the routing problem. Finally simulations have verified that this algorithm has simple operation, fast convergence speed, high reliability, stronger practicality and robustness.