On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

Authors:
Moonseong Kim;Minseok Kang;Hyunseung Choo;Jong S. Yang;Young-Cheol Bang
Affiliations:
School of Info. and Comm. Engineering, Sungkyunkwan University, Korea;Dep. of Computer Engineering, Korea Polytechnic University, Korea;School of Info. and Comm. Engineering, Sungkyunkwan University, Korea;Korea Institute of Industrial Technology Evaluation and Planning, Korea;Dep. of Computer Engineering, Korea Polytechnic University, Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 8
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
On multicast communications with minimum resources

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Research: A group multicast routing algorithm by using multiple minimum Steiner trees

Computer Communications
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.