A Web Service Composition Framework Based on Centrality and Community Structure

Reusing existing services for developing business process applications helps reducing the development time and cost. Besides, existing atomic services may not be able to answer users' requirements. Therefore, as manual composition takes time and is error prone, automatic service composition methods are needed. Their objective is to find the best composite service with minimum number of services and the best performance in term of Quality of Service (QoS). In this paper, a complex network based service composition framework is proposed. It is based on a network representation of the Web service space, making it possible to exploit efficiently various centrality properties and its community structure. It applies the A* search algorithm by considering different network centralities (degree, betweenness, closeness) together with various static and dynamic QoS attributes (execution time, availability and number of calls, changing values of QoS over different timestamps) in its heuristic. Furthermore, the network community structure is integrated in the process, in order to reduce the execution time and increase the accuracy of composition.