Multi-Constrained Routing Based on Tabu Search

The development of efficient quality of service (QoS) routing algorithms in a high-speed network environment is a very difficult task due to the need to provide divergent services with multiple QoS requirements. In this paper, we propose TS_MCOP, a novel heuristic algorithm, by applying Tabu search to Dijkstra's algorithm. The heuristic first translates multiple QoS weights into a single metric and then seeks to find a feasible path by Tabu search. Simulation results show our algorithm has features of well performance of success ratio and cost optimization.