On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Abstract

Abstract.In this paper, we study the problem of constructing minimum cost group multicast trees with bandwidth reservations. Our algorithm uses multiple candidate paths to select a path from source to each destination member in each multicast tree construction. We show that our proposed algorithm performs better in terms of total tree cost for real life networks over well-known algorithm GKMB. The enhancement is up to about 10% ∼ 25% in terms of normalized surcharge for the GKMB tree cost.