Study On The Dynamic Colonal Selection Algorithm For QoS Multicast Routing

The video, audio and multimedia information of network environment are essential components in our work and life. Quality of Service (QoS) is a Security Mechanism of Network, advanced performances includes guarantee of efficiency in the network, prevent network congestion and other advantages. While transmission speed is improved and the safety of network is ensured, QoS will dramatically save network band resource and improve the efficiency of data transmission.The QoS-based multicast routing problem is a strategy that satisfies multiple QoS constraints, which will guarantee the Internet Quality of Service and improve multicast technology. The mission of QoS Routing is to seek a constraint road that include Bandwidth, delay, Jitter, cost limit, etc. Experts have testified that it would became an NP-C issue that It is impossible to seek accurate solution in deterministic polynomial time unless through the total solution space to find the optimal solution,if the number of constraint conditions of QoS-based multicast routing problem is above 2.QoS routing are structured to provide maximum flexibility for servicing different needs, which meet the heterogeneous and dynamic characteristic of the network. There are many methods to solve the problem of NP-C, such as Annealing Algorithm, Genetic Algorithm, neural networks and Ant colony algorithm, etc. At present the mature algorithm is ant colony algorithm. Due to the ant colony algorithm is distributed intelligent algorithms, robust, a certain probability global search space, efficient solution, it became the ability of effective combinatorial optimization problem of one of heuristic algorithm. But because the ant colony algorithm with blindness, no specific aim, to path search time generally longer and is easily the most important stagnant, the defects of the phenomenon is due to network is a dynamic environment, and lack of ant colony algorithm to the characteristics of dynamic environment.Therefore, this paper studied artificial immune system, and in the light of the QoS multicast routing problem in the immune system, try to find solution NP-C problem. And puts forward the dynamic colonal selection algorithm (DCSA) used in QoS routing algorithms. DCSA is one kind has the dynamic characteristics of clonal selection algorithm, scholars generally put DCSA in network fault diagnosis, can solve autologous set changeful environment. Therefore, this article to resolve the QoS multicast routing algorithm convergence slow, lack of dynamic early for the purpose, by the characteristics of DCSA algorithm, seeking algorithm in QoS of multicast routing problem DCSA the cohesion point, found existing local optimal algorithm, detector generated a low efficiency of faults, and put forward the improvement plan, improve the efficiency of the algorithm.This paper based on the algorithm proposed algorithm model, introduces in detail the structure and function of the modules. Will eventually algorithm to QoS multicast routing, in the experimental stage, according to the actual network environment, and build a simulation network environment, simulation of multicast routing algorithm realization QoS.