An optimal dynamic multicast routing algorithm for multimedia applications
Minjae Kang · 1997
A source-based optimal dynamic multicast routing algorithm is proposed, which satisfies the network conditions of delay constraints and cost minimization and adapts to a dynamic network events. Also, we look at the following network requirements: efficient dynamic group support, high-quality data distribution, and adaptability to dynamically changing events. We construct a dynamic delay-bounded optimal multicast tree using partial multicast routing and evaluate the performance of the proposed algorithm by running simulations, written in C++, with randomly-generated test networks on a Sun Sparc 20 workstation. By choosing appropriate values for the delay bound, we were able to obtain an optimal solution that lies between the minimum-cost solution and the minimum-delay one.