Title :
Multi-Constrained Routing Based on Tabu Search
Author :
Lin, Huang ; Xue-Wu, Du ; Jin, Xiao
Author_Institution :
Dalian Univ. of Technol., Dalian
fDate :
May 30 2007-June 1 2007
Abstract :
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.
Keywords :
graph theory; quality of service; search problems; telecommunication network routing; Tabu search; heuristic algorithm; multiconstrained routing; multipath constrained optimal path problem; quality of service; Automatic control; Automation; Cities and towns; Cost function; Heuristic algorithms; High-speed networks; Lagrangian functions; Mathematics; Quality of service; Routing;
Conference_Titel :
Control and Automation, 2007. ICCA 2007. IEEE International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-1-4244-0817-7
Electronic_ISBN :
978-1-4244-0818-4
DOI :
10.1109/ICCA.2007.4376338
