A method based on distributed algorithm of delay-bounded multicast routing

More and more applications, such as IPTV systems, are required to provide real-time, high-quality information service. Multicast is an efficient method to send one copy of packet to many destinations simultaneously, and stringent delay is an important factor in the transmission. A delay constrained distributed multicast routing algorithm - DPMR is proposed in this paper. In the algorithm, the construction of a relatively optimal multicast routing tree is driven by the destination nodes through their calculating, searching in the specified delay bound within the nearest their tree node. Meanwhile, the destination driven method can alleviate the burden of source or central node, reduce the cost of communication network and convergence time. The simulation results show that the algorithm is easy to implement, spending small amount of calculation time, and having good performance.