A Heuristic Algorithm for QoS Multicast Routing

In recent years, QoS multicast routing has continued to be a very important research topic in the areas of net-works. This paper presents a heuristic algorithm for the QoS multicast routing (HAQMR). This heuristic algorithmdeals with delay and bandwidth constraints and has low cost. The HAQMR attempts to significantly reduce the overheadfor constructing a multicast tree. the proof for correctness of the HAQMR is given, and the performance of the HAQMRis evaluated by simulations. The study shows that HAQMR provides an available approach to QoS multicast routing.