QDMR: An Efficient QoS Dependent Multicast Routing Algorithm

Authors:
Liang Guo;Ibrahim Matta
Affiliations:
-;-
Venue:
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Year:
1999

Citing 0
Cited 13

A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups

Electronic Commerce Research
An Adaptive Multicast Tree with QoS Support for Heterogeneous Recipients

Journal of VLSI Signal Processing Systems
Multicast routing with multiple constraints in high-speed networks based on genetic algorithms

ICCC '02 Proceedings of the 15th international conference on Computer communication
Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications
Celerity: towards low-delay multi-party conferencing over arbitrary network topologies

Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video
Celerity: a low-delay multi-party conferencing solution

MM '11 Proceedings of the 19th ACM international conference on Multimedia
An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem

Computer Communications
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem

Operations Research Letters
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

Computer Communications
A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks

Computer Communications

Quantified Score

Hi-index	0.03

Visualization

Abstract

Many real-time applications, such as video conferencing, require the transmission of messages from a sender to multiple receivers subject to Quality-of-Service (QoS) delivery constraints (e.g. bounded delay). This requires the underlying multicast protocol to find a QoS-constrained minimum-cost communication path (tree). However, finding such a tree is known to be computationally expensive. In this paper, we present a fast heuristic, called QDMR, for generating delay-constrained low-cost multicast routing trees. A salient feature of QDMR is that it dynamically adjusts its low-cost tree construction policy based on how far the current on-tree node is from violating the QoS delay bound. This QoS dependent (adaptive) tree construction, together with the capability to merge least-delay paths into the low-cost tree in case of stringent delay requirements, lead to the following properties: (1) QDMR guarantees to find a feasible multicast tree if such tree exists; (2) this delay-bounded multicast tree is very rapidly generated; and (3) the tree has low cost. Through analysis and extensive simulations, we confirm the premise of QDMR by comparing it to many existing multicast algorithms.