Redundant-Free Web Services Composition Based on a Two-Phase Algorithm

Abstract

Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant web services in the results. In this paper, we proposed a redundant-free web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the Link Index. In the backward phase, redundant-free web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.

Redundant Service Removal in QoS-Aware Service Composition

“…The only difference in constructing a planning graph is the termination condition when there is no solution found. Instead of terminating at a fixed point level when no solution is found, [11] forces the forward phase stops at the maximum number of computation M AX, where M AX needs to be given in advance. We should say computation M AX is not a good idea as compared to the fixed point theorem.…”

“…Instead of using the backward search phase to extract a solution without redundant services from a planning graph, [18] presented three strategies to construct a simplified planning graph with less redundant services. [11] proposed a non-redundant web services composition based on a two-phase algorithm. The principle underlying the forward phase of finding parallel executable web services is similar to the construction of a planning graph.…”

Performance formula‐based optimal deployments of multilevel indices for service retrieval

“…One is that their storage structures are related with users' requirements, the other is that they are independent of requirements. The former method is to construct a structure after receiving users' requirements, such as previous studies, while the latter is to insert a new service into a structure when the service is registered, such as previous studies …”

“…Kwon et al and Kwon and Lee use link index to store services. Oh et al use state node network to store services.…”

“…Since service composition is time‐consuming compared with service discovery, some works propose their service storage structure to reduce composition time. However, they do not consider the support to service discovery and service manage and maintenance.…”