DocumentCode :
711953
Title :
One Multi-constraint QoS Routing Algorithm CGEA Based on Ant Colony System
Author :
Benlai Liang ; Jiangde Yu
Author_Institution :
Dept. of Comput. Eng., Zhongshan Polytech., Zhongshan, China
fYear :
2015
fDate :
24-26 April 2015
Firstpage :
848
Lastpage :
851
Abstract :
CGEA (Convergence Gradients Expectation Ant algorithm) is proposed in this paper, which can get the optimal path quickly by precomputing the Convergence grads expectation of improved ant algorithm. QoS metrics of link can be measured by expectation function and the optimal path can be got efficiently by comparing the convergence grads.
Keywords :
ant colony optimisation; gradient methods; quality of service; telecommunication network routing; CGEA; QoS metrics; ant colony system; convergence gradients expectation ant algorithm; multiconstraint QoS routing algorithm; Algorithm design and analysis; Computers; Convergence; Measurement; Network topology; Quality of service; Routing; Ant algorithms; Convergence gradients expectation; Multi-constraint QoS routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Control Engineering (ICISCE), 2015 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4673-6849-0
Type :
conf
DOI :
10.1109/ICISCE.2015.193
Filename :
7120733
Link To Document :
بازگشت