@inproceedings{1fc6651a27554d13b919f5b70599e2c0,
title = "On multicasting with minimum costs for the internet topology",
abstract = "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.",
author = "Bang, \{Young Cheol\} and Hyunseung Choo",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th International Euro-Par Conference on Parallel Processing, Euro-Par 2002 ; Conference date: 27-08-2002 Through 30-08-2002",
year = "2002",
doi = "10.1007/3-540-45706-2\_102",
language = "English",
isbn = "3540440496",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "736--744",
editor = "Burkhard Monien and Rainer Feldmann",
booktitle = "Euro-Par 2002 Parallel Processing - 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings",
}