QDMR: An Efficient QoS Dependent Multicast Routing Algorithm

Free registration required

Executive Summary

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. This paper present a fast heuristic, called QDMR, for generating delay-constrained low-cost multicast routing trees.

  • Format: PDF
  • Size: 289 KB