A new scalable multicast routing algorithm for interactive real-time applications

Authors:
Mohamed Aissa;Adel Ben Mnaouer;Rion Murray;Habib Youssef;Abdelfettah Belghith
Affiliations:
University of Nizwa, Nizwa, Sultanate of Oman;Dar Al-Uloom, Riyadh, Saudi Arabia;University of Trinado and Tobago, Omeara, Trinado and Tobago;ISITCom Sousse, University of Sousse, Sousse, Tunisia;HANA Research Group, ENSI, University of Manouba, Manouba, Tunisia
Venue:
Personal and Ubiquitous Computing
Year:
2011

Citing 5
Cited 1

The multimedia multicasting problem

Multimedia Systems
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
A new delay-constrained algorithm for multicast routing tree construction: Research Articles

International Journal of Communication Systems
DVBMN-l: delay variation bounded multicast network with multiple paths

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

QoS-driven multicast routing in sparse-splitting optical networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

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.