Dynamic Service Selection Based on Ant Colony System-Reference-Cited by-同舟云学术

Dynamic Service Selection Based on Ant Colony System

Published:2012-06 Issue: Volume:182-183 Page:2136-2141
ISSN:1662-7482
Container-title:Applied Mechanics and Materials
language:
Short-container-title:AMM

Author:

Li Ying¹,Tong Wei Qin¹,Zhi Xiao Li¹,Ding D.¹

Affiliation:

1. Shanghai University

Abstract

In this paper,ant colony system(ACS)is applied to the dynamic service selection.We design the novel pheromone update rule and the path length between the service node is generated by the QoS parameters of the services. The optimal path in ACS is correspond to a set of optimal QoS parameters composition of services. When the QoS parameters of services are changed, the parameters of ACS will be changed automatically during the process of finding the shortest path. That will improve the reliability of the service selection.

Publisher

Trans Tech Publications, Ltd.

Link

https://www.scientific.net/AMM.182-183.2136.pdf

Reference10 articles.

1. Carey M, Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. NewYork: W.H. Freeman and Company, (2005).

2. SGoss S Aron, J L Deneubourg, J M Pasteels. Self-organized shortcuts in the Argentine ant[J]. Naturwissen-chafien, 1989, 76 : 579 - 581.

3. Coloni A, Dorigo M, Maniezzo V, et al. Distributed Optimization by Ant Colonies[C] Proceedings of European Conference on Artificial Life. Paris, France1991, 134-142.

4. WANG Yong, DAI Gui-ping, JIANG Zheng-tao et al. A Trust Enhanced Service Composition Scheduling Algorithm [J]. Acta Electronica Sinica, 37(10): 2234-2238, (2009).

5. Li Shiyong, Chen yongqiang, Li yan. The ant algorithm and application. Harbin Institute of Technology, (2004).