Cluster-Guided Genetic Algorithm for Distributed Data-intensive Web Service Composition

Automatic Web service composition has received much interest in the last decades. Data-intensive concepts have provided a promising computing paradigm for data-intensive Web service composition. Due to the complexity of the problem, metaheuristics in particular Evolutionary Computing (EC) techniques have been used for solving this composition problem. However, most of the current works neglected the distributed nature of data-intensive Web services. In this paper, we study the problem of distributed data-intensive service composition and propose a model which integrates attributes of constituent data-intensive Web services and attributes of the network. The core idea is to propose a communication cost and time model of a composed Web service considering communication delay and cost. We therefore propose a novel method based on Genetic Algorithm (GA) which uses a variation of K-means clustering algorithm.