A combined approach for QoS based multicast routing and resource allocation

In this paper, we present a general framework for the problem of QoS multicast routing with resource allocation. Our framework uses functional forms derived from various queuing service disciplines for the QoS parameters rather than static metrics. We give formal definition of the QoS multicast routing problem with resource allocation. This problem is different from the minimum Steiner tree problem in networks which has been considered extensively. We show that QoS multicast routing with resource allocation problem is NP-complete. We present a 2-approximate greedy heuristic based on Prim´s minimum spanning tree algorithm which suboptimally solves the multicast routing with. resource allocation problem.