ASCSS: An Automatic Service Composition Approach Based on Service Similarity

This paper realizes an approach for automatic service composition based on graph search (ASCGS for short). It forms an interoperable directed graph (IDG) by utilizing the interoperable relationships among services, and each request will be inserted temporarily to the graph as a special node, thus the automatic service composition can be implemented by searching of possible directed acyclic graphs (DAGs) from the request¿s input to its output. In order to reduce the size of IDG, and to decrease the cost of DAG merging operations that could be executed in some ¿joint¿ nodes, an optimized approach is proposed by taking advantage of service similarity (ASCSS for short). ASCSS maintains service input covering network for groups of similar services, which might take out some redundant edges from IDG or just merge some nodes together. It can also enable the parent nodes to reuse the searching results of its children. Evaluations demonstrated that the one using ASCSS can achieve considerable optimization with respect to different service similarity, interval time and search times. It is proved that the existence of service similarity, especially equal services, can improve the efficiency of automatic service composition by using covering network.