Abstract
A new meta-heuristic algorithm is proposed for constructing multicast trees in real-time multimedia applications such that satisfies two important Quality of Service (QoS) constraints. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. We evaluate the performance and efficiency of the proposed method with a modified version of the BSMA algorithm which is the best known deterministic heuristic algorithm to delay-constrained multicast problem. Simulation results reveal that the proposed algorithm can achieve a smaller average tree costs than modified BSMA with a much smaller running time for relatively large networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kun, Z., Yong, Q., Hong, Z.: Dynamic Multicast Routing Algorithm for Delay and Delay Variation-Bounded Steiner Tree Problem. Knowledge-Based Systems 19(2006), 554–564 (2006)
Wang, X., Cao, J., Cheng, H., Huang, M.: QoS Multicast Routing for Multimedia Group Communications Using Intelligent Computational Methods. Computer Communications 29(12), 2217–2229 (2006)
Lee, K.S., Geem, Z.W.: A New Meta-Heuristic Algorithm for Continues Engineering Optimization: Harmony SearchTheory and Practice. Comput. Methods Appl. Mech. Engrg
Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J.: An Iterative Algorithm for Delay-Constrained Minimum-Cost Mmulticasting. IEEE/ACM Transactions on Networking 6(4) (1998)
Wang, Z., Crowcroft, J.: Quality of Service for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)
Esbensen, H.: Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using Genetic Algorithm. Networks 26, 173–185 (1995)
Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Informatica 15 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahdavi, M., Forsati, R., Movaghar, A. (2008). Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_92
Download citation
DOI: https://doi.org/10.1007/978-3-540-89985-3_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89984-6
Online ISBN: 978-3-540-89985-3
eBook Packages: Computer ScienceComputer Science (R0)