EDA-based approach to comprehensive quality-aware automated semantic web service composition

Abstract

Comprehensive quality-aware automated semantic web service composition is an NP-hard problem, where service composition workflows are unknown, and comprehensive quality, i.e., Quality of services (QoS) and Quality of semantic matchmaking (QoSM) are simultaneously optimized. The objective of this problem is to find a solution with optimized or near-optimized overall QoS and QoSM within polynomial time over a service request. In this paper, we proposed novel memetic EDA-based approaches to tackle this problem. The proposed method investigates the effectiveness of several neighborhood structures of composite services by proposing domain-dependent local search operators. Apart from that, a joint strategy of the local search procedure is proposed to integrate with a modified EDA to reduce the overall computation time of our memetic approach. To better demonstrate the effectiveness and scalability of our approach, we create a more challenging, augmented version of the service composition benchmark based on WSC-08 [1] and WSC-09 [2]. Experimental results on this benchmark show that one of our proposed memetic EDA-based approach (i.e., MEEDA-LOP) significantly outperforms existing state-of-the-art algorithms.

Robustness Estimation and Optimisation for Semantic Web Service Composition With Stochastic Service Failures

“…5, we tidy up permutation [4, 1, 0, 2, 3] into [1, 2, 3, |4, 0] (| is just displayed for the courtesy of the reader, but not part of the representation) as an input of local search. We produce this permutation by combining two parts, one part [1,2,3] Given a candidate permutation Π with its decoded : A permutation Π * corresponding to Scenario 6 is constructed, where local search starts: [55]) to Π . To perform this local search, the layer information (i.e., different layers include different web services as layer members) must be utilised.…”

“…The second layer L 2 contains those services that can be executed by using I T and outputs produced by services in L 1 . Other layers can be discovered in a similar way, see the layer discovery technique in [5,55]. Therefore, a neighbouring permutation is produced by swapping two selected service indexes Π a and Π b in the permutation.…”

A model‐driven approach for semantic web service modeling using web service modeling languages

“…35 The key characteristics of the SmartWS and a reference implementation framework were proposed in Maleshkova et al, 36 and the quality and usability of SmartWS were described by specifying a maturity model. The effectiveness of several neighborhood structures of the composite services were investigated in Wang et al 37 by proposing domain-dependent local search operators. The proposed model of Diac et al 38 was designed in the context of stateless information-providing services.…”

Distributed Data-intensive Web Service Composition

“…In the context of single-objective WSC, EC techniques have become increasingly popular [46,129,189,205]. Examples include Particle Swarm Optimisation algorithm (PSO) [96] in [51], Ant Colony Optimisation (ACO) [65] in [196] and GAs in [30].…”

“…We have compared the performance of different algorithms based on the weighted sum in Equation (3.7) (Section 3.3) so far, following the common practice in the literature [29,49,189]. The weighted sum approach provides the user with a single final solution.…”