QoS Multicast Routing Optimization Algorithm Based on Hybrid Algorithm

Abstract

The multicast routing problem with multiple QoS constraints is NP complete problem. The solution of the problem usually adopts the method of optimizing. In this paper a network model suitable for investigating the routing problem was described based on QoS constrains such as delay, delay jitter, bandwidth and packet loss metrics. A multicast routing algorithm with multiple QoS constraints was presented based on GA and TS hybrid strategy. This algorithm took advantage of GA and TS (Tabu Search), and overcame the shortcomings of GA in solving the multicast routing problem with multiple QoS constraints-poor climbing ability and immature convergence. Simulation results show that higher search efficiency and faster convergence is achieved in the hybrid algorithm and the algorithm is an effective approach to multicast routing decision with multiple QoS constraints.