DocumentCode
537100
Title
The Study of Improved Ant Colony Algorithm for Routing Problem of Service Composition
Author
Guo, Shuhang ; Zhang, Yating ; Hai, Mo
Author_Institution
Sch. of Inf., Central Univ. of Finance & Econ., Beijing, China
fYear
2010
fDate
7-9 Nov. 2010
Firstpage
1
Lastpage
4
Abstract
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established, and the solving process is presented. Finally, simulation experiment will show that improved ant colony algorithm is more applicable in solving routing problem of service composition.
Keywords
optimisation; problem solving; quality of service; search problems; telecommunication network routing; Dijkstra algorithm; improved ant colony algorithm; problem solving model; routing problem; service composition; stability; Adaptation model; Bandwidth; Delay; Heuristic algorithms; Network topology; Quality of service; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference on
Conference_Location
Henan
Print_ISBN
978-1-4244-7159-1
Type
conf
DOI
10.1109/ICEEE.2010.5660998
Filename
5660998
Link To Document