Conference Paper

QoS-Based Web Service Composition Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm

DOI: 10.1109/eScience.2008.110 Conference: Fourth International Conference on e-Science, e-Science 2008, 7-12 December 2008, Indianapolis, IN, USA
Source: DBLP


In the field of semantic grid, QoS-based Web service composition is an important problem. In semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the composition consider not only QoS properties of Web services, but also inter service dependencies and conflicts which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address the Web service composition optimization problem in the presence of domain constraints and inter service dependencies and conflicts. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

Download full-text


Available from: Maolin Tang, Mar 09, 2015
30 Reads
  • Source
    • "In SOC, the problem of QoS-aware service composition was often modeled as constraint optimizing problems and solved by (mixed) linear inter-programming [2], genetic algorithms [11] [12] [13](GAs) or hybrid approaches [14]. In recent approaches, the service execution contexts, including bandwidth [15], policy context [16], device context [13], etc, are also considered in the QoS models for the composition problems. "
  • Source
    • "This problem is studied as emphases in this paper. In [9], a genetic algorithm with repair mechanism is presented to solve service selection conflict problem. This algorithm increases the possibility to obtain a feasible solution, but conflict mediation can only be made by service reselection to a single activity. "
    [Show abstract] [Hide abstract]
    ABSTRACT: When there are a lot of candidate component services in Web services composition, the suitable component services need to be selected. The service selection conflicts often occur due to the functional dependency relationships between component services. Therefore, a service selection conflict avoidance algorithm is presented. First, a formal service selection model is presented to reflect the component services, the process of service composition and the functional dependency relationships of component services. Then, based on the presented model, a service selection algorithm to avoid service conflicts is designed by using a conflict mediation mechanism, which supports multilevel backtracking and service reselection. Finally, the performance of the algorithm is tested by simulation experiments. The experiment results indicate that a service composition without any service conflict can be accomplished rapidly via the presented algorithm.
    07/2013; DOI:10.2991/cse.2013.30
  • Source
    • "We adopt an existing repair genetic algorithm (GA) [11] to solve this problem since the GA seems to be suitable to solve such problems. "
    [Show abstract] [Hide abstract]
    ABSTRACT: QoS-aware service composition intends to max-imize the global QoS of a composite service while selecting candidate services from different providers with local and global QoS constraints. With more and more candidate services emerging from all over the world, the network delays often greatly impact the performance of the composite service, which are usually not easy to be collected before the composition. One remedy is to predict them for the composition. However, new issues occur in predicting network delay for the composition, including prediction accuracy and on-demand measures to new services, which affect the performance of network-aware com-posite services. To solve these critical challenges, in this paper, we take advantage of the geographic location information of candidate services. We propose a network-aware QoS (NQoS) model for the composite service. Based on that, we present a novel geographic location-based NQoS prediction approach before composition, and a NQoS re-prediction approach during the execution of the composite service. Extensive experiments are conducted on the real-world dataset collected from Plan-etLab. Comparative experiment results reveal our approach facilitates to improve the prediction accuracy and predictability of the NQoS values, and increase global NQoS of the composite service while ensuring its reliability constraints.
    20th International Conference on Web Services (ICWS), Santa Clara, CA, USA; 06/2013
Show more