Multicast Routing Algorithms With Constraints In Networks

With the development of communication, Multicast technology is becoming crucial in computer network to support multimedia application. Multicast consists of concurrently sending the same information from a source to a subset of all possible destinations in computer network. Tree construction is a commonly used approach in solving the multicast routing problem with constraints. This paper centers on how to construct a low cost multicast routing trees with QoS(Quality of Service) requirements. Recently, researches on multicast routing algorithm centers mainly on unconstrained multicast routing and delay-constrained multicast routing.In this thesis, we present a new delay-constrained multicast routing algorithm, and prove that this algorithm has polynomial-time complexity. The simulation results show that this algorithm has lower time complexity than KPP and BSMA algorithm, and lower cost than CDKS algorithm although it has a cost close to KPP and BSMA algorithm. So it is a low time complexity and appropriate cost multicast routing algorithm.