A Multicast Routing Algorithm Under the Delay-Restricted Network Environment

Nowadays, the network is expected to service much more multimedia data with the improvement of the network communication bandwidth and development of the processing capacity. In the multicasting communication system, once every receiving end separately sends the data packets, the network resources intend to be wasted, and the calculating stress on the nodes is also going to be increased. A distributed delay-restricted multicast route heuristic method DMPH (delay-constrained minimal-cost path heuristic) is presented in this article. This algorithm proposed in the article can achieve a convergence speed, back up dynamic multicast, and offer the pretty good the network overhead performance. In order to gain the better performance of the network cost, the article firstly proposes a mathematical topological model of the problem over the delay-constrained multicast routing, and then presents a dynamic multicast delay-restricted multicast route algorithm which is called DMPH (Delay-Constrained Minimal-Cost Path Heuristic), fast-convergent and distributed. The computing simulation results suggest that the method pro-posed can gain the better performance of the network cost. In addition, the article just addressed the operation of the addition and quit of the nodes on the dynamic varying of the multicast group, but not concerned the over-head optimal. These problems mentioned above are all our future research work.