A tree-growth based ant colony algorithm for QoS multicast routing problem

摘要: QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find tree with minimal cost that can satisfy constraints such as bandwidth, delay, and delay jitter. This problem NP-complete. The solution problems often search first for paths from the source node each destination then integrate these into tree. Such method, however, slow complex. To overcome shortcomings, we propose new method tree-based optimization. Our algorithm optimizes directly, unlike conventional solutions finding integrating them generate applies ant colony control growth in order Via orthogonal experiments, most efficient combination of various parameters selected so quality improved. We evaluate performance efficiency proposed comparison other existing algorithms. Simulation results show our performs well searching, converging speed adaptability scale.