Abstract
Quality of service (QoS) provisioning generally assumes more than one QoS measure that implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded delay variation among the source and all destinations while keeping overall cost of the multicast tree low. The main contribution of our work is a new strategy for constructing multiconstrained multicast trees. We first derive mathematically a new delay-variation estimation scheme and prove its efficiency. Thereafter, we propose a simple and competitive (in terms of running time) heuristic algorithm, for delay and delay variation constrained routing problem based on the proposed delay-variation estimation scheme and using the Extended Prim-Dijkstra tradeoffs’ algorithm. Our contribution also extends previous works in providing some properties and analyses of delay bounded paths satisfying delay variation constraints. Extensive simulation results show that our algorithm outperforms DVDMR in terms of multicast delay variation with the same time complexity as DVDMR.
Similar content being viewed by others
References
Lee H-Y, Youn C-H (2000) Scalable multicast routing algorithm for delay-variation constrained minimum cost tree. In: Proceedings of the IEEE ICC2000 conference, New Orleans
Rouskas G, Baldine I (1997) Multicast routing with end-to-end delay and delay variation constraints. IEEE J Sel Areas Commun 15(3)
Bhamidipati V, Kilari S (2010) Effect of delay/delay variation on QoE in video streaming. Master Thesis, School of Computing, Blekinge Institute of Technology, Karlskrona, Sweeden
Bhattacharya A, Yang Z (2009) DVBMN-l: delay variation bounded multicast network with multiple paths. In: Proceedings of the ICME 2009 conference, New York
Heberman BK (1997) Cost, delay, and delay variation conscious multicast routing. Master Thesis, Graduate Faculty of North Carolina State University, Raleigh
Guo L, Matta I (2000) QDMR: an efficient QoS dependent multicast routing algorithm. J Commun Netw Spec Issue QoS IP Netw 2(2)
Alpert CJ, Hu TC, Huang JH (1993) A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing. In: Proceedings of the IEEE international symposium on circuit and systems, Chicago, pp 1869–1872
Aissa M, Mnaouer AB (2004) A new delay-constrained algorithm for multicast routing tree construction. Int J Commun Syst IJCS 985–1000
Prim BC (1959) Shortest connecting networks and some generalizations. Bell Syst Tech J 36:1389–1401
Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269–271
Salama HF, Reeves DS, Viniotis Y (1995) Evaluation of multicast routing algorithms for distributed real-time applications on high-speed networks. In: Proceedings of 6th IFIP conference on high speed networks, pp 27–42
Joseph C et al (1998) The multimedia multicasting problem. Multimedia Syst N6:43–59
Salama HF et al (1995) MCRSIM simulator source code and users’ manual. Center for Advanced Computing and Communication, North Carolina State University, Raleigh. Available by anonymous ftp at ftp.csc.ncsu.edu:/pub/rtcomm.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aissa, M., Ben Mnaouer, A., Murray, R. et al. A new scalable multicast routing algorithm for interactive real-time applications. Pers Ubiquit Comput 15, 833–844 (2011). https://doi.org/10.1007/s00779-011-0370-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00779-011-0370-8