The Research Of Multicast Routing Algorithm In Computer Network

With the rapid popularization of Internet and the rapid development of some high-bandwidth applications, there have been many new communication services, such as video on demand, e-mail blasts, online games, distance learning, video conference and so on. Such applications consume amounts of network resources significantly, and have a higher quality of service requirements by multiple users. Multicast is an effective way to reduce network bandwidth consumption and increase data transmission efficiency of communication which in such applications has been widely used. The problems of QoS multicast routing which research how to better realize the multicast function under meet the demand of service quality become a research hotspot.This paper researches and analyzes a variety of multicast routing algorithm, obtained the advantages and disadvantages of various algorithms, analysis of algorithm based on ant colony algorithm and delay-constrained multicast routing and algorithm based on clone algorithm for delay-constrained multicast routing. On the basis of them, this topic has designed a clonal celection algorithm with receptor editing and an overall optimize routing algorithm based on cloning strategy improved.The clonal selection algorithm with receptor editing is better than the usual clonal selection algorithm. The good gene segment in the immaturity subpopulation was adopted and receptor editing was conducted based on the principle of minimum cost and delay constrain separately. Results show that RECSA can search promptly for optimum solution without a prepared routing set. The process is also featured lower computational complexity and higher stability. This papre has also been used RECSA to the solution of the QoS problems in multicast routing, proposed a overall optimize multicast routing algorithm based on improved Cloning strategy. After fulfilling the condition of the time delay restraint, a parameter Q, which considers the balance the three performance including time delay, band width and the expense, is defined and introduced to measure the overall performance, maintaining the compromise and balance among the three Indies. This overcomes the problem in traditional solutions to multicast routing, namely the improvement of a performance parameter resulted in serious degeneration of other parameters. The results of simulation tests indicate its high searching efficiency, capable of adjusting the whole performance of the multicast routing and improved service quality of the QoS. So it can be applied to multicast areas such as video-on-demand.