Based On The Genetic Algorithm For Multi-constraint Multicast Routing Optimization Strategy

With the popularization and development of Internet, especially the applications of the newly distributed multimedia and the development of Internet multimedia techniques, the traditional routing techniques couldn't meet the new application in Quality of Service. Therefore, the latest routing techniques not only pave the way for data transmission, but also need to consider whether the choosed rooting parameter of bandwidth, delay, delay-jitter, packet-lost rate satisfied with the needs of practical application, namely routing algorithm must have the ability of QoS, and analyze the load of whole Internet in order to balance the data circulation of each path. In addition, whatever singlecast or multicast, within-area or inter-area routing, the entire routing algorithm must have convergence and efficiency.At present, most of the multicast routing algorithm researches prone to adopt heuristic algorithm to solve unconstrained and delay-constrained multicast routing problems. However, these heuristic algorithms have the highly time complexity so that they couldn't meet the needs of applications. The paper deals with a genetic algorithm, after optimized the choice of initial populations and fitness function, this method will greatly reduce the time in the process of algorithm of QoS single cast routing and QoS multicast routing. And this paper make a detail in how to choose QoS multicast routing, by the use of genetic algorithm solved several QoS-constrained routing's choosing problems. As a result, it shows that this algorithm is practicable and effective.