QoS-Aware Service Selection based on Genetic Algorithm

The web service selection is a primordial step in the support of dynamic compositions, in fact, the presence of a set of services that provide the same functionality (inputs/outputs), but differ in QOS criteria, obliges us to adopt an optimization strategy in order to select the best ones. Several approaches of various natures (mono-objective, multi-objective...) were proposed to solve this problem. In this paper we propose a genetic algorithm which handles a single objective function and a set of global constraints that must be fulfilled. The obtained results are encouraging and merit to be continued. Keywordsweb services; combinatory optimization; genetic algorithms;qualiy of service;service oriented architecture.

[1]  Anne H. H. Ngu,et al.  QoS computation and policing in dynamic web service selection , 2004, WWW Alt. '04.

[2]  Thomas Risse,et al.  Combining global optimization with local selection for efficient QoS-aware service composition , 2009, WWW '09.

[3]  Sanjiva Weerawarana,et al.  Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDI , 2002, IEEE Internet Computing.

[4]  Athman Bouguettaya,et al.  Foundations for Efficient Web Service Selection , 2009 .

[5]  Yaron Goland,et al.  Web Services Business Process Execution Language , 2009, Encyclopedia of Database Systems.

[6]  I. Maros.  Computational Techniques of the Simplex Method , 2002 .

[7]  Anne H. H. Ngu,et al.  Declarative composition and peer-to-peer provisioning of dynamic Web services , 2002, Proceedings 18th International Conference on Data Engineering.

[8]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.

[9]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[11]  Thomas Risse,et al.  Selecting skyline services for QoS-based web service composition , 2010, WWW '10.

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

[13]  Amit P. Sheth,et al.  Modeling Quality of Service for Workflows and Web Service Processes , 2002 .

[14]  Danilo Ardagna,et al.  Global and local QoS constraints guarantee in Web service selection , 2005, IEEE International Conference on Web Services (ICWS'05).

[15]  H. Adeli,et al.  Augmented Lagrangian genetic algorithm for structural optimization , 1994 .

[16]  Fangchun Yang,et al.  Q-Peer: A Decentralized QoS Registry Architecture for Web Services , 2007, ICSOC.

[17]  Danilo Ardagna,et al.  Adaptive Service Composition in Flexible Processes , 2007, IEEE Transactions on Software Engineering.

[18]  David Pisinger,et al.  Algorithms for Knapsack Problems , 1995 .

[19]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[20]  S. Martello,et al.  Algorithms for Knapsack Problems , 1987 .

[21]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

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

[23]  Graham K. Rand,et al.  Quantitative Applications in the Social Sciences , 1983 .