A graph b-coloring based scheme for Composition-Oriented Web Services Abstraction: COWSA
Résumé
Automatic web services composition has drawn a great deal of attention recently. Indeed, a large number of composition methods already exist. These methods should provide efficient and scalable composition, with good response time, which ensures a good quality of service. In this paper, we propose a self-learning scheme named COWSA to enhance the performances of existing Web services composition algorithms. Our scheme is based on a new dynamic clustering of Web services, that is oriented to Web services composition. The Web services that are often composed, are grouped together dynamically to form a meta group of services or what we call meta composite services. This clustering is performed through using the b-coloring of graphs. We conduct a series of experiments to evaluate the contribution and the performances of our scheme.