Intelligent Multicast Routing

In computer networks, multicasting is becoming increasingly important. Tree construction is a commonly used approach arises from the ability to potentially share many links in transmitting the message to destination set. Multicast routing algorithms are used to compute a multicast trees of good performance.Based on these new Intelligent algorithms , three delay-constrained multicast algorithms are proposed. The main research work and results are followed:1 Clonal Strategies based multicast algorithm is proposed. It converts delay -constrained multicast problem to the selection of candidate paths,and uses Clonal Strategies to select candidate. Simulations prove, it saliently solves the "prematurity" problem and therefoe has better ability of global searching with the property of stabilization, agility and operating simply.2 Immune Clone Based Multicast Routing is proposed by combining the advantages of Immune Algorithm and Clonal Strategies. Comparing with the conventional genetic algorithm(GA).The algorithm instructs the search process and accelerates the search speed by importing the transcendental knowledge relative to some specific problems.A Clonal Strategies(CS) based multicast algorithm is proposed in this thesis, the algorithm is accelerated by using an adjustable parameter based on clone multicast algorithm to control the search space.