Study on delay constrained multicast routing algorithm extended for bi-directional network

摘要

In this paper, a new delay constraint multicast routing algorithm is proposed. Delay constraint multicast routing algorithms calculate route whose delay between sender and all destinations are under given delay bound. Bounded Shortest Multicast Algorithm (BSMA) has proposed as delay constraint multicast routing algorithm. BSMA achieves cost-effective tree than other algorithms. BSMA exchanges path composing of calculating tree to make tree cost lower. When we implement BSMA to calculate route in bidirectional network, BSMA has to reestimate delay bound condition after path exchange. This is because that end node of lower cost path and higher cost path are different. The proposed algorithm searches lower cost path whose end point is same to exchanged path. This procedure excludes reestimation process and makes calculation speed fast. Computer simulation will show that the proposed algorithm has better performance than BSMA and already proposed delay constraint algorithm.