Springer-Verlag Lecture Notes in Computer Science, vol. 4487, pp. 668-675, May 2007
Moonseong Kim, Gunu Jho, and Hyunseung Choo
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.