An Investigation In Dynamic Multi-constrained Multicast Routing Based On Multi-point Paralleled Ant Search

With the rapid progress and the commerce use of Internet, many applications, which require high bandwidth, achieved great progress. The most conspicuous features of these applications mentioned are multi-received point and high bandwidth. The good way to solve the problem is the multicast technology in IP networks which must meet the QoS constrains. The algorithms, which are under discussion, do not consider the QoS constrains, for example, the PIM, CBT and MOSPF etc. Considering that, the multicast which meet the multi-media applications is catching more and more attentions. The result achieved now is restricted to the multipoint-fixed model which is not use in many applications. So we must define a new model based on mobile multipoint.The ant algorithm, which is enlightened by the real ant in nature, is put forward a few years ago. This algorithm is among one of the most successful algorithms which is based on colony aptitude. The ant algorithm is used in many NP problems such as TSP problem and routing problems constrained QoS requirements.With fully researching on multicast problems studied before, we put forward an algorithm model which is focused on the mobile multi-point problem. And for speeding the algorithm, we made some mend to this algorithm. The simulation we made express that the algorithm is applicable to the multicast whose members is mobile and this algorithm has some practical use.