An Effective Dynamic Web Service Selection Strategy with Global Optimal QoS Based on Particle Swarm Optimization Algorithm

被引：23

作者：

Kang, Guosheng ^{[1
]}

Liu, Jianxun ^{[1
]}

Tang, Mingdong ^{[1
]}

Xu, Yu ^{[1
]}

机构：

[1] Hunan Univ Sci & Technol, Key Lab Knowledge Proc & Networked Mfg, Xiangtan 411201, Peoples R China

来源：

2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW) | 2012年

关键词：

Service Composition; Service Selection; QoS Global Optimal; Multi-objective Optimization; PSO (particle swarm optimization);

D O I：

10.1109/IPDPSW.2012.281

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Dynamic Web service selection with global QoS optimization in Web service composition is a critical issue in Web service composition. In order to solve the problem, based on intelligent optimal theory of particle swarm optimization (PSO) algorithm, we propose a strategy PSO-GODSS (global optimization of dynamic Web service selection based on PSO) algorithm to implement Web service selection with QoS global optimization. The basic idea of the algorithm is to transform the original Web service selection problem into a multi-objective services composition optimization problem with global QoS constraints, which is further transformed into a single-objective problem by using the method of ideal point. Then, the theory of intelligent optimization of PSO is applied to produce a set of optimal services composition process with QoS constraints. Theoretical analysis and experimental results indicate the feasibility and efficiency of this algorithm, and the execution efficiency and convergence rate of PSO-GODSS are much better than that of multi-objective genetic algorithm used in prior work.

引用

页码：2280 / 2285

页数：6

共 19 条

[1]

Alrifai Mohammad, 2010, P 19 INT C WORLD WID, P11, DOI DOI 10.1145/1772690.1772693

[2]

[Anonymous], P IEEE INT C WEB SER

[3]

[Anonymous], 2009, PROC 18 INT C WORLD

[4]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness

[5]

[Anonymous], 2003, SIGECOM EXCH

[6] Declarative composition and peer-to-peer provisioning of dynamic Web services [J].

Benatallah, B ;

Dumas, M ;

Sheng, QZ ;

Ngu, AHH .

18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, :297-308

[7]

Casati F, 2000, LECT NOTES COMPUT SC, V1789, P13

[8]

Fan XQ, 2009, LECT NOTES COMPUT SC, V5854, P271

[9]

Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968

[10]

Lianyong Qi, 2010, 2010 IEEE International Conference on Web Services (ICWS), P34, DOI 10.1109/ICWS.2010.62

← 1 2 →