Automated web service composition using genetic programming

Automated web service composition is a popular research topic because it can largely reduce human eorts as the business increases. This thesis presents a search-based approach to fully automate web service composition which has a high possibility to satisfy user\u27s functional requirements given certain assumptions. The experiment results show that the accuracy of our composition method using Genetic Programming (GP), in terms of the number of times an expected composition can be derived versus the total number of runs can be over 90%. System designers are users of our method. The system designer begins with a set of available atomic services, creates an initial population containing individuals (i.e. solutions) of candidate service compositions, then repeatedly evaluates those individuals by a fitness function and selects better individuals to generate the next population until a satisfactory solution is found or a termination condition is met. In the context of web service composition, our algorithm of genetic programming is highly improved compared to the traditional genetic programming used in web service composition in three ways: 1. We comply with services knowledge rules such as service dependency graph when generating individuals of web service composition in each population, so we can expect that the convergence process and population quality can be improved. 2. We evaluate the generated individuals in each population through black-box testing. The proportion of successful tests is taken into account by evaluating the fitness function value of genetic programming, so that the convergence rate can be more effective. 3.We take cross-over or mutation operation based on the parent individuals\u27 input and output analysis instead of just choosing by probability as typically done in related work. In this way, better children can be generated even under the same parents. The main contributions of this approach include three aspects. First, less information is needed for service composition. That is, we do not need the composition work- ow and the semantic meaning of each atomic web service. Second, we generate web service composition with full automation. Third, we generate the composition with high accuracy owing to the effect of carefully preparing test cases

Avaliação de um Algoritmo para Composição Automática de Web Services.

A composição de Web Services é um tema amplamente explorado na literatura sob diferentes aspectos. Contudo, observou-se que essas pesquisas não são voltadas para o processo como um todo: da requisição criada e enviada por um cliente até o recebimento de uma resposta por este, passando antes pelas etapas de composição dos serviços e execução do fluxo de trabalho. A partir dessa brecha, o presente trabalho mostra o desenvolvimento de um sistema – implantado em rede local – capaz de realizar todas as etapas citadas anteriormente, além de medir o tempo gasto em cada uma delas. Para tal, realizou-se a integração entre as ferramentas AWSCS e EPESWS com o objetivo de fazer a avaliação de desempenho de uma composição automática de Web Services. Os resultados aqui exibidos conseguem revelar qual etapa é o gargalo do sistema, ou seja, aquela que leva mais tempo para sua realização

Automated web service composition using genetic programming

Automated web service composition is a popular research topic because it can largely reduce human eorts as the business increases. This thesis presents a search-based approach to fully automate web service composition which has a high possibility to satisfy user's functional requirements given certain assumptions. The experiment results show that the accuracy of our composition method using Genetic Programming (GP), in terms of the number of times an expected composition can be derived versus the total number of runs can be over 90%. System designers are users of our method. The system designer begins with a set of available atomic services, creates an initial population containing individuals (i.e. solutions) of candidate service compositions, then repeatedly evaluates those individuals by a fitness function and selects better individuals to generate the next population until a satisfactory solution is found or a termination condition is met. In the context of web service composition, our algorithm of genetic programming is highly improved compared to the traditional genetic programming used in web service composition in three ways: 1. We comply with services knowledge rules such as service dependency graph when generating individuals of web service composition in each population, so we can expect that the convergence process and population quality can be improved. 2. We evaluate the generated individuals in each population through black-box testing. The proportion of successful tests is taken into account by evaluating the fitness function value of genetic programming, so that the convergence rate can be more effective. 3.We take cross-over or mutation operation based on the parent individuals' input and output analysis instead of just choosing by probability as typically done in related work. In this way, better children can be generated even under the same parents. The main contributions of this approach include three aspects. First, less information is needed for service composition. That is, we do not need the composition work- ow and the semantic meaning of each atomic web service. Second, we generate web service composition with full automation. Third, we generate the composition with high accuracy owing to the effect of carefully preparing test cases.</p