TY - GEN
T1 - Advanced bounded shortest multicast algorithm for delay constrained minimum cost
AU - Kim, Moonseong
AU - Jho, Gunu
AU - Choo, Hyunseung
PY - 2007
Y1 - 2007
N2 - The Bounded Shortest Multicast Algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are corrected, and an improved scheme is proposed without changing the main idea of the BSMA.
AB - The Bounded Shortest Multicast Algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are corrected, and an improved scheme is proposed without changing the main idea of the BSMA.
KW - Bounded Shortest Multicast Algorithm (BSMA)
KW - Delay-Bounded Minimum Steiner Tree (DBMST) problem
KW - Multicast routing algorithm
UR - https://www.scopus.com/pages/publications/37249004945
U2 - 10.1007/978-3-540-72584-8_89
DO - 10.1007/978-3-540-72584-8_89
M3 - Conference contribution
AN - SCOPUS:37249004945
SN - 9783540725831
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 668
EP - 675
BT - Computational Science - ICCS 2007 - 7th International Conference, Proceedings, Part I
PB - Springer Verlag
T2 - 7th International Conference on Computational Science, ICCS 2007
Y2 - 27 May 2007 through 30 May 2007
ER -