A Fast Heuristic Algorithm for the Composite Web Service Selection

Composite Web Service selection is one of the most important issues in Web Service Composition. During the selection process, while the decision making during the selection process is much easy in the term of the functional properties of Web Service, it is very difficult in terms of the non-functional properties. In this paper, we investigate the problem of composite Web Service selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parameters of each component service based on the definition in [16]. We map the multi-dimensional QoS composite Web Service to the multi-dimensional multi-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nl lgn) complexity for solving the problem.

[1]  Joe Clabby.  Web Services Explained, Solutions and Applications for the Real World , 2002 .

[2]  Mohammad Sohel Rahman,et al.  Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..

[3]  Eric G. Manning,et al.  Quality adaptation in a multisession multimedia system: model, algorithms, and architecture , 1998 .

[4]  Jing Ning,et al.  A Dynamic Web Services Selection Algorithm with QoS Global Optimal in Web Services Composition , 2007 .

[5]  Jack Dongarra,et al.  Computational Science — ICCS 2001 , 2001, Lecture Notes in Computer Science.

[6]  Danilo Ardagna,et al.  Global and Local QoS Guarantee in Web Service Selection , 2005, Business Process Management Workshops.

[7]  Fabio Casati,et al.  Dynamic and adaptive composition of e-services , 2001, Inf. Syst..

[8]  Yan Gao,et al.  Optimal Web Services Selection Using Dynamic Programming , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[9]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[10]  Charles Riley,et al.  Quality of Service (QoS) , 2020, CCNA Certification Study Guide.

[11]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[13]  Eric G. Manning,et al.  Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem , 2001, International Conference on Computational Science.

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Efstathios D. Sykas,et al.  QoS-aware service evaluation and selection , 2008, Eur. J. Oper. Res..

[16]  Osman Oguz,et al.  A heuristic algorithm for the multidimensional zero-one knapsack problem , 1984 .

[17]  Guido Governatori,et al.  Compliance aware business process design , 2008 .

[18]  Andreas Drexl,et al.  A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.

[19]  Andrzej Cichocki,et al.  Managing Process and Service Fusion in Virtual Enterprises , 1999, Inf. Syst..

[20]  Mourad Debbabi,et al.  QoS-Aware Middleware for Web Services Composition - A Qualitative Approach , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[21]  Tao Yu,et al.  Quality of service (qos) in web services: model, architecture and algorithms , 2006 .

[22]  Kyong-Ho Lee,et al.  Fast Quality Driven Selection of Composite Web Services , 2006, 2006 European Conference on Web Services (ECOWS'06).