A new 0–1 linear program for QoS and transactional-aware web service composition

@article{Gabrel2012AN0,
  title={A new 0–1 linear program for QoS and transactional-aware web service composition},
  author={Virginie Gabrel and Maude Manouvrier and Imen Megdiche and C{\'e}cile Murat},
  journal={2012 IEEE Symposium on Computers and Communications (ISCC)},
  year={2012},
  pages={000845-000850}
}
In this article, we propose a new model based on 0-1 linear programming for determining a composite web service (structured by a workflow) maximizing a QoS aggregate measure and satisfying transactional properties. The QoS measure is a classical weighted sum of five QoS criteria and the transactional properties are a set of rules that ensures a reliable execution of the composite web service. The proposed 0-1 linear program is solved using a standard solver (CPLEX) and our experiments show that… 
View on IEEE
computer.org
18 Citations
Background Citations
7
Methods Citations
4

Figures and Tables from this paper

18 Citations

A new linear program for QoS-aware web service composition based on complex workflow

This is the first time that a linear program with a polynomial number of variables and constraints is proposed for QoS-driven web service composition based on complex workflow with interlaced patterns.

Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming

A model based on 0-1 linear programming for automatically determining a transactional composite web service (CWS) from a service dependency graph that optimizes a QoS measure that is able to find the optimal solutions of big size test sets, as the Web Service Challenge 2009.

Web services composition: Complexity and models

Using an Estimation of Distribution Algorithm to Achieve Multitasking Semantic Web Service Composition

A novel method for effective knowledge sharing across different service compositions in both the single-tasking and multitasking contexts is introduced, and the proposed approach, PMFEA-EDA, takes much less time than existing approaches, and also outperforms them in terms of both QoSM and QoS.

Web Service Composition Based on Petri Nets: Review and Contribution

This article presents a review of approaches using Petri Nets for WS composition: a transactional-QoS-driven WS selection approach and a framework for reliable execution of Composite WSs based on Colored Petrinets.

A correlation-driven optimal service selection approach for virtual enterprise establishment

This paper formally proposes a business correlation model including both quality correlations and selection correlations, and presents an efficient approach for correlation-driven QoS-aware optimal service selection based on a genetic algorithm.

A correlation-driven optimal service selection approach for virtual enterprise establishment

This paper formally proposes a business correlation model including both quality correlations and selection correlations, and presents an efficient approach for correlation-driven QoS-aware optimal service selection based on a genetic algorithm.

An Automatic Configuration Algorithm for Reliable and Efficient Composite Services

A hierarchical model for composite services is developed and a new composite service configuration (CSC) algorithm, called required efficiency level, is developed to offer more flexibility to the customers to specify their needs in terms of QoS.

An approach to optimize mashup based on QoS-Skyline and transactional properties

This paper proposes a mashup optimization method based on QoS-Skyline and transactional properties that first adopts skyline approaches to improve the efficiency of selection by using the dominance relationship of skyline to prune services, then employs adaptive particle swarm optimization to select service from amount of candidates.

Evolutionary computation for automatic Web service composition: an indirect representation approach

A novel framework based on an indirect representation is proposed and tested, with results showing that the quality of the solutions produced by the proposed indirect approach is higher than that of a baseline direct representation-based approach for twelve out of the thirteen datasets considered.

References

SHOWING 1-10 OF 20 REFERENCES

A Global Graph-based Approach for Transaction and QoS-aware Service Composition

This paper proposes a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints, and identifies building rules and the reduction method to build layer-based Directed Acyclic Graph model which can model transactional relationships among candidate services.

TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition

This paper addresses the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics by proposing a selection algorithm that satisfies user's preferences as weights over QoS criteria and as risk levels defining semantically the transactional requirements.

Towards a Genetic Algorithm Approach to Automating Workflow Composition for Web Services with Transactional and QoS-Awareness

This paper proposes an automatic composition approach through genetic algorithm to satisfy user¡¦s functional requirements, QoS criteria, and transactional requirements automatically at the same time.

QoS-aware middleware for Web services composition

This paper presents a middleware platform which addresses the issue of selecting Web services for the purpose of their composition in a way that maximizes user satisfaction expressed as utility functions over QoS attributes, while satisfying the constraints set by the user and by the structure of the composite service.

Efficient algorithms for Web services selection with end-to-end QoS constraints

A broker-based architecture is designed to facilitate the selection of QoS-based services and efficient heuristic algorithms for service processes of different composition structures are presented.

Combining global optimization with local selection for efficient QoS-aware service composition

This paper proposes a solution that combines global optimization with local selection techniques to benefit from the advantages of both worlds and significantly outperforms existing solutions in terms of computation time while achieving close-to-optimal results.

Service selection algorithms for Web services with end-to-end QoS constraints

  • Tao YuKwei-Jay Lin
  • Computer Science
    Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004.
  • 2004
This paper studies the end-to-end QoS issues of composite services by utilizing a QoS broker that is responsible for selecting and coordinating the individual service component, and proposes two solution approaches to the service selection problem: the combinatorial approach, by modeling the problem as the Multiple Choice Knapsack Problem (MCKP), and the graph approach, as the constrained shortest path problem in the graph theory.

Scenario Analysis of Web Service Composition based on Multi-Criteria Mathematical Goal Programming

This work takes care of the issues pertaining to inputs and outputs matching of web services and Quality-of-Service (QoS) at the same time and proposes a compromised composition based on the trade-off of customer's preference on the QoS goals.

Transactional-Aware Web Service Composition: A Survey Transactional-Aware Web Service Composition: A Survey

This chapter distinguishes the more relevant and recent propositions in two groups: approaches based on WS transactional properties and the ones also integrating QoS criteria to the composition process.

Applying Multi-objective Evolutionary Algorithms to QoS-Aware Web Service Composition

Experimental results reveal that SPEA2 is able to approach the Pareto-optimal front with well spread distribution, and the algorithm is good at dealing with multi-objective combinational optimisation problems.