Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree

The delay-constrained heuristics for multicast routing algorithms capable of satisfying the quality of services requirements of real time applications are essential under distributed network environments. However, some of these heuristics may fail to provide a low cost tree as they assume that network links are symmetric. Furthermore, the time required constructing such a tree might be prohibitive, especially for large networks, as they employ a brute-force approach to search for low-cost delay-bounded paths among the route candidates. In this paper, we propose a new efficient algorithm considering delay variation constraints as well as with the total cost minimization scheme of the multicast trees. The extensive simulations show that the proposed algorithm satisfies the QoS requirement for real-time traffic, very short execution time and good scalability applicable to multicast groups in large networks