Springer-Verlag Lecture Notes in Computer Science, vol. 2400, pp. 736-744, Aug. 2002 (SCI)
Young-Cheol Bang and Hyunseung Choo
We have developed and evaluated a novel heuristic algorithm
for the construction of a multicast tree with minimizing tree costs. Our
algorithm works on directed asymmetric networks and is shown here to
have a perform gain in terms of tree costs for Internet like networks over
existing algorithms. The time complexity of our algorithm is O(D×m) for
a m-arc network with D number of members in the multicast group and
is comparable to well-known algorithms for multicast tree construction.
We have performed empirical evaluation that compares our algorithms
with the others on large networks.