QoS multicast routing algorithms based on Tabu Search with Elite candidate list

Quality-of-Service Multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the neglected aspects of Tabu Search, candidate list strategy. We evaluate the performance and efficiency of the proposed algorithms on a variety of random generated networks. Evaluation results indicate that the proposed algorithms overcome the other existing short-term memory version of TS-based algorithms and heuristics regarding average tree cost and running time.