On multicast communications with minimum resources

Authors:
Young-Cheol Bang;SungTaek Chung;Moonseong Kim;Seong-Soon Joo
Affiliations:
Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Carrier Ethernet Team, Electronics and Telecommunications Research Institute, Daejun, Korea
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 8
Cited 2

Network flows: theory, algorithms, and applications

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

IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Multicasting with Minimum Costs for the Internet Topology

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
A QoS-aware multicast routing protocol

IEEE Journal on Selected Areas in Communications

On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
On multicasting steiner trees for delay and delay variation constraints

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed and evaluated an efficient heuristic algorithm to construct a multicast tree with the minimum cost. Our algorithm uses multiple candidate paths to select a path from source to each destination, and works on directed asymmetric networks. We also show that our proposed algorithm have a perform gain in terms of tree cost for real life networks over existing algorithm. The time complexity of our algorithm is O( D (m + nlogn) ) for a m-arc n-node network with D number of members in the multicast group, and is comparable to well-known algorithm, TM [13], for a multicast tree construction in terms of the time-complexity. We have performed empirical evaluation that compares our algorithms with the others on large networks.