Advanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost

Authors:
Moonseong Kim;Gunu Jho;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Korea;Telecommunication Network Business, Samsung Electronics, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 3
Cited 1

An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications

On QoS multicast routing algorithms using k-minimum Steiner trees

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.