A EFFICIENT ALGORITHM FOR DELAY-CONSTRAINED MULTICAST ROUTING

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 dissertation work a fast heuristic, called QDMR (QoS Dependent Multicast Routing) is implemented, 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. Through simulation QDMR is compared with other existing multicast routing algorithms. We have proposed a algorithm , which improves the cost of the constrained multicast tree as well as the execution time of the algorithm. Proposed algorithm is evaluated for tree cost and execution speed. Software is written in C++, and works under LINUX environment.