Solving Multiconstrained Quality of service Multicast Routing Problem using Simulated Annealing Algorithm

Multicast routing is a telecommunication technique that simultaneously sending data from one, or more source to several destination. Multimedia applications are widely used. These applications require several QoS constraints. This paper proposes a multi-constrained QoS multicast routing method using simulated annealing metaheuristic. The proposed algorithm minimizes the cost of multicast tree while satisfying bandwidth, delay, delay jitter, and packet loss constraints. In the proposed approach we use R-Path move method to construct neighbors. The simulation results demonstrate that our algorithm is better for cost performance, best multicast tree obtained, compared to others algorithms.