An Approach for Quality of Service based Multicast Routing
Document Type Article
In this report, we present a general framework for the problem of QoS multicast and unicast routing with resource allocation. Our framework uses functional forms derived from various queuing service disciplinesfor the QoS parameters rather than static metrics. We give formal definitions of the QoS multicast and unicast routing with resource allocation problems. This problem formulation is different from the traditional optimal path/tree searching problems which have been considered extensively in literature. 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.