Computer Networkes Have Constrained QoS Multicast Routing Algorithm

Multicast routing can be described as follow:according to a source node s,a group of destination node set D,a serises of limited condition C and some optimal objects,a tree can be found to cover up s and D and is satisfied with CNowadays the study of multicast is consentrated as follows:bandwidth constraint multicast routing,delay constraint multicast routing,delay constraint and least costmulticast routing,delay and dely-jitter constraint multicast routing.The solution for this kind of problem is NP-complete.It means that there is no definition polynomialcomplexity solution.This paper presents the principle,the characteristics,the construction and realization method about the basic model AS(Ant System) of the antcolony algorithm.Experimental analyses are carried out on the reasonable selection on the parameters of this algorithm,and basic principles for the parameter selection are provided.The paper proposes an Orthogonal,Orthogonal design multicas optimal.In accordance with multiple constrained QoS multicast routing problem,a new algoritlmlMMR-ACO is proposed.MMR-ACO accelerates the speed of converergence through structuring definite selecting probability function and mutation operator;In order to meeting users QoS demand,MMR-ACO implements punishment pheromone updating tactics based on multipie independent QoS constraints:Considering practical application of network,the load balancing based on utilization ratio of the link and the tactics of congestion avoidable rerouting have been introduced in the algorithm design,which can improve the robustness of algorithm.The experimental result indicates MMR-ACO is a kind of correct, effective QoS multicast routing algorithm.In this paper,I propose a new algorithm-ACGA to solve QoS multicast routing problem,which is combined with the ant algorithm and the genetic algorithm.Simulation results show that ACGA is superior to the genetic algorithm and the ant algorithm in quality and efficiency.