×

Bandwidth-delay constrained least cost multicast routing for multimedia communication. (English) Zbl 1183.68050

Sarbazi-Azad, Hamid (ed.) et al., Advances in computer science and engineering. 13th international CSI computer conference, CSICC 2008, Kish Island, Iran, March 9–11, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89984-6/pbk; 978-3-540-89985-3/ebook). Communications in Computer and Information Science 6, 737-740 (2008).
Summary: 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.
For the entire collection see [Zbl 1154.68025].

MSC:

68M10 Network design and communication in computer systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] 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) · doi:10.1016/j.knosys.2006.04.012
[2] 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) · Zbl 05397609 · doi:10.1016/j.comcom.2006.02.015
[3] Lee, K.S., Geem, Z.W.: A New Meta-Heuristic Algorithm for Continues Engineering Optimization: Harmony SearchTheory and Practice. Comput. Methods Appl. Mech. Engrg · Zbl 1096.74042
[4] 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) · doi:10.1109/90.720901
[5] Wang, Z., Crowcroft, J.: Quality of Service for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996) · doi:10.1109/49.536364
[6] Esbensen, H.: Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using Genetic Algorithm. Networks 26, 173–185 (1995) · Zbl 0856.90115 · doi:10.1002/net.3230260403
[7] Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Informatica 15 (1981) · Zbl 0445.68051 · doi:10.1007/BF00288961
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.