On Multicast Communications with Minimum Resources

Bang, Young-Cheol; Chung, Sung-Taek; Kim, Moonseong; Joo, Seong-Soon

doi:10.1007/11557654_4

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, if we increase the set for the greedy strategy, the final multicast trees may lead to lower cost solution for GMRP. The proposed algorithm is based on MCMT algorithm [3] and we call this algorithm Group MCMT (GMCMT). Since the MCMT algorithm finds multiple shortest paths and also considers the nodes between the group members and the relay nodes, we strongly believe that the proposed algorithm GMCMT is better than the performance of GKMB.…”

Section: Group Mcmt Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Kim

Kang

Choo

et al. 2007

Computational Science – ICCS 2007

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Group Mcmt Algorithmmentioning

confidence: 99%

“…Recently, Bang et al proposed the Minimum Cost Multicast Tree (MCMT) algorithm [3] to create minimum Steiner tree. MCMT is proved that it has the nearest optimal tree cost than other algorithms, are known to be the best heuristic.…”

Section: Introductionmentioning

confidence: 99%