| Multicast technology (multicast) has important application in IPTV, video conference,remote education and so on , it implements data transmission from one source node to multiple destination node , the mission is to determine a minimal link cost multicast tree. But there always exist many new nodes join the network and many original nodes leave the network,it makes the network in the process of constant change. So design a multicast routing algorithms which is suitable for dynamic network is one of the hot spot of research. In this paper, we study network topology changes over time dynamic network multicast routing optimization problem.In this paper, we study the multicast routing of dynamic network problem with time varying network topology. The specific contents are as follows:Firstly,by studying the previous research of Waxman network,then design a dynamic random network, whose member nodes are added and deleted randomly with time changing.The experiment of the proposed algorithm in this paper is based on designed dynamic random network.Secondly, by analyzing the relationship between the multicast tree structure and network topology to classify nodes in network, then proposed an encoding strategy which can clearly reflect nodes attributes and better adapt to dynamic network. This strategy can reduce the searching space and accelerate the algorithm convergence speed. A tree variable degree is introduced to judge the influence of the network changes to the previous multicast tree, and according to the value of tree variable degree to adjust the major parameter of Artificial Fish Swarm Algorithm (AFSA), which changes the performance of algorithm convergence.Finally, applied the coding method and the tree variable degree in the AFS A,then used the crowding actor of the AFSA to guarantee the diversity, according to the behavior strategy of the AFS A gets multicast routing in dynamic network.The simulation and analysis results show that the algorithm has effective performance. |
PDF Full Text Request