An efficient core selection algorithm for delay and delay-variation constrained multicast tree design

Authors:
Adel Ben Mnaouer;Mohamed Aissa;Abdelfettah Belghith
Affiliations:
Center of ICT, University of Trinidad and Tobago;Computer Dept, Community College in Shaqra, Kingdom of Saudi Arabia;ENSI, Univ. of Manouba, Tunisia
Venue:
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Year:
2009

Citing 4
Cited 0

Trade-offs on the location of the core node in a network

Networks
AQoSM: Scalable QoS multicast provisioning in Diff-Serv networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose new strategies in core selection methods and core-based tree (CBT) construction based on new methods of computing delay variation. As a result, we propose an algorithm, which guarantees that the delay from the source to any destination does not exceed a real-time constraint. Furthermore, we address the problem of satisfying the delay variation constraint under cost minimization. We present a new core and path selection methods that take both cost and delay simultaneously into consideration. Thus, we achieve a balance of optimizing cost and delay of the multicast tree. The problem is known to be as NP-complete. A solution to this problem is required to provide decent real-time communication services such as on-line gaming, shopping, and teleconferencing.