ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper On Multicast Communications with Minimum Resources
Cited 3 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Young-Cheol Bang, Sung Taek Chung, Moon Seong Kim, Seong-Soon Joo
Issue Date
2005-09
Citation
International Conference on High Performance Computing and Communcations (HPCC) 2005 (LNCS 3726), v.3726, pp.4-13
Publisher
Springer
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.1007/11557654_4
Abstract
We have developed said 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 com-... parable to well-known algorithm, TM [13], for a multicast.; tree con- : struction in terms of the time-complexity. We have performed empirical evaluation that compares our algorithms with the others on large, networks. © Springer-Verlag Berlin Heidelberg 2005.
KSP Keywords
Empirical Evaluation, Heuristic algorithm, Minimum cost, Multicast group, Multicast tree, Time Complexity, asymmetric networks, multicast communication, node network