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

ABSTRACT

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

Full-text

Available from: Maolin Tang, Mar 09, 2015
  • Source
    • "The first are the underlying concepts of dependency determination that are carried out with the help of neural networks. The second part deals with questions of installation efforts and scalability to seamlessly integrate the modeling into real IT- environments[38].Ai and Tang have given 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[39]. As it is clear from the above observations, that most of the dependency analysis and modeling techniques are centered on Graph based approach or algorithmic approach. "

    Preview · Article · Jan 2016
  • 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. "

    Full-text · Dataset · Feb 2015
  • 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.
    Preview · Article · Jul 2013
Show more